论文信息 - Injective coloring of plane graphs with girth 5

Injective coloring of plane graphs with girth 5

An injective coloring of a graph is a vertex coloring where two vertices have distinct colors if a path of length two exists between them. Let G be a plane graph with g(G)>=5 and @g"i(G) be the injective chromatic number of G. In this paper, we improve some known results by proving that @g"i(G)@[email protected]+3 if @D(G)>=35 and @g"i(G)@[email protected]+6 for arbitrary @D(G).

Wei Dong | Wensong Lin

[1] Daniel W. Cranston,et al. Injective Colorings of Graphs with Low Average Degree , 2010, Algorithmica.

[2] André Raspaud,et al. Injective coloring of planar graphs , 2009, Discret. Appl. Math..

[3] J. A. Bondy,et al. Graph Theory with Applications , 1978 .

[4] André Raspaud,et al. Some bounds on the injective chromatic number of graphs , 2010, Discret. Math..

[5] Daniel W. Cranston,et al. Injective colorings of sparse graphs , 2010, Discret. Math..

[6] Rui Li,et al. Injective choosability of planar graphs of girth five and six , 2012, Discret. Math..

[7] Wei Dong,et al. Injective coloring of planar graphs with girth 6 , 2013, Discret. Math..

[8] Jan Kratochvíl,et al. On the injective chromatic number of graphs , 2002, Discret. Math..

[9] Kai Lu,et al. List injective coloring of planar graphs with girth 5, 6, 8 , 2013, Discret. Appl. Math..

[10] J. A. Bondy,et al. Graph Theory with Applications , 1978 .

[11] Martin Tancer,et al. Injective colorings of planar graphs with few colors , 2009, Discret. Math..