We prove that the incidence chromatic number of every 3-degenerated graph G is at most Δ
(G)+ 4. It is known that the incidence chromatic number of every graph G with maximum …

We introduce the incidence game chromatic number which unifies the ideas of game
chromatic number and incidence coloring number of an undirected graph. For k-degenerate …

An incidence in a graph G is a pair (v, e) where v is a vertex of G and e is an edge of G
incident to v. Two incidences (v, e) and (u, f) are adjacent if at least one of the following …

This paper proves that if G is a cubic graph which has a Hamiltonian path or G is a
bridgeless cubic graph of large girth, then its incidence coloring number is at most 5. By …

An incidence in a graph G is a pair (v, e) where v is a vertex of G and e is an edge of G
incident to v. Two incidences (v, e) and (u, f) are adjacent if at least one of the following …

Incidence coloring of a graph G is a mapping from the set of incidences to a color-set C such
that adjacent incidences of G are assigned distinct colors. Since 1993, numerous fruitful …

An incidence in a graph $ G $ is a pair $(v, e) $ with $ v\in V (G) $ and $ e\in E (G) $, such
that $ v $ and $ e $ are incident. Two incidences $(v, e) $ and $(w, f) $ are adjacent if $ v= w …

Let χ i (G) and Δ (G) denote the incidence coloring number and the maximum degree of a
graph G, respectively. An easy observation shows that χ i (G)⩾ Δ (G)+ 1. In this paper, we …

An incidence of a graph G is a pair (v, e) where v is a vertex of G and e is an edge of G
incident with v. Two incidences (v, e) and (w, f) of G are adjacent whenever (i) v= w, or (ii) e …

An incidence in a graph G is a pair (v, e) where v is a vertex of G and e is an edge of G
incident to v. Two incidences (v, e) and (u, f) are adjacent if at least one of the following …