2-distance 4-colorability of Planar Subcubic Graphs with Girth at Least 22
暂无分享,去创建一个
[1] Oleg V. Borodin,et al. 2-distance (Delta+2)-coloring of planar graphs with girth six and Delta>=18 , 2009, Discret. Math..
[2] Anna O. Ivanova,et al. List 2-distance (Δ + 1)-coloring of planar graphs with girth at least 7 , 2011 .
[3] Magnús M. Halldórsson,et al. Coloring powers of planar graphs , 2000, SODA '00.
[4] Oleg V. Borodin,et al. 2-Distance 4-coloring of planar subcubic graphs , 2011 .
[5] Mohammad R. Salavatipour,et al. A bound on the chromatic number of the square of a planar graph , 2005, J. Comb. Theory, Ser. B.
[6] Oleg V. Borodin,et al. Sufficient conditions for planar graphs to be 2-distance ()-colourable. , 2004 .
[7] Haitze J. Broersma,et al. A structural theorem on planar triangulations in terms of bunches and stars , 2001 .
[8] Martin Tancer,et al. List-Coloring Squares of Sparse Subcubic Graphs , 2008, SIAM J. Discret. Math..
[9] D. de Werra,et al. Graph Coloring Problems , 2013 .
[10] Oleg V. Borodin,et al. List 2-distance (Delta+2)-coloring of planar graphs with girth six , 2009, Eur. J. Comb..
[11] A. O. Ivanova,et al. 2-distance ( ∆ + 2 )-coloring of planar graphs with girth six and ∆ ≥ 18 , 2009 .
[12] Oleg V. Borodin,et al. Sufficient conditions for the minimum 2-distance colorability of plane graphs of girth 6. , 2006 .
[13] Mohammad R. Salavatipour,et al. Frequency Channel Assignment on Planar Networks , 2002, ESA.
[14] G. Wegner. Graphs with given diameter and a coloring problem , 1977 .
[15] Frédéric Havet. Choosability of the square of planar subcubic graphs with large girth , 2009, Discret. Math..
[16] Daniel Král,et al. Coloring squares of planar graphs with girth six , 2008, Eur. J. Comb..
[17] André Raspaud,et al. A note on 2-facial coloring of plane graphs , 2006, Inf. Process. Lett..
[18] Tommy R. Jensen,et al. Graph Coloring Problems , 1994 .
[19] Oleg V. Borodin,et al. 2-distance coloring of sparse planar graphs. , 2004 .