论文信息 - On 2-distance coloring of plane graphs with girth 5

On 2-distance coloring of plane graphs with girth 5

A vertex coloring is called 2 -distance if any two vertices at distance at most 2 from each other get different colors. Let ź 2 ( G ) be the 2-distance chromatic number of a graph G . Suppose G is a plane graph with girth 5 and maximum degree Δ . In this paper, we prove that if Δ ź { 7 , 8 } , then ź 2 ( G ) ź Δ + 7 . Furthermore, we show that ź 2 ( G ) ź Δ + 4 if Δ is sufficiently large.

Wei Dong | Wensong Lin

[1] Mohammad R. Salavatipour,et al. A bound on the chromatic number of the square of a planar graph , 2005, J. Comb. Theory, Ser. B.

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

[3] Hajo Broersma,et al. Stars and bunches in planar graphs. Part II: General planar graphs and colourings , 2002 .

[4] Oleg V. Borodin,et al. 2-distance coloring of sparse planar graphs. , 2004 .

[5] Jan van den Heuvel,et al. Coloring the square of a planar graph , 2003 .

[6] G. Wegner. Graphs with given diameter and a coloring problem , 1977 .

[7] Oleg V. Borodin,et al. Sufficient conditions for planar graphs to be 2-distance ()-colourable. , 2004 .

[8] Wei Dong,et al. An improved bound on 2-distance coloring plane graphs with girth 5 , 2016, J. Comb. Optim..

[9] Daniel Král,et al. Coloring squares of planar graphs with girth six , 2008, Eur. J. Comb..

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

[11] Yuehua Bu,et al. An optimal square coloring of planar graphs , 2012, J. Comb. Optim..

[12] Oleg V. Borodin,et al. 2-distance (Delta+2)-coloring of planar graphs with girth six and Delta>=18 , 2009, Discret. Math..

[13] Ko-Wei Lih,et al. Labeling Planar Graphs with Conditions on Girth and Distance Two , 2004, SIAM J. Discret. Math..