Coloring the square of graphs whose maximum average degree is less than 4
暂无分享,去创建一个
[2] A. O. Ivanova,et al. 2-distance ( ∆ + 2 )-coloring of planar graphs with girth six and ∆ ≥ 18 , 2009 .
[3] Marthe Bonamy,et al. List coloring the square of sparse graphs with large degree , 2013, Eur. J. Comb..
[4] Marthe Bonamy,et al. Graphs with maximum degree Δ≥17 and maximum average degree less than 3 are list 2-distance (Δ+2)-colorable , 2014, Discret. Math..
[5] Richard M. Wilson,et al. A course in combinatorics , 1992 .
[6] Oleg V. Borodin,et al. 2-distance (Delta+2)-coloring of planar graphs with girth six and Delta>=18 , 2009, Discret. Math..
[7] Ko-Wei Lih,et al. Labeling Planar Graphs with Conditions on Girth and Distance Two , 2004, SIAM J. Discret. Math..
[8] Daniel Král,et al. Coloring squares of planar graphs with girth six , 2008, Eur. J. Comb..
[9] Marthe Bonamy,et al. 2-Distance Coloring of Sparse Graphs , 2014, J. Graph Theory.
[10] G. Wegner. Graphs with given diameter and a coloring problem , 1977 .
[11] C. Charpentier. 2-distance coloring of not-so-sparse graphs , 2014 .
[12] Matthew P. Yancey. Coloring the square of a sparse graph G with almost Δ(G) colors , 2016, Discret. Appl. Math..