|
Sibirskii Matematicheskii Zhurnal, 2009, Volume 50, Number 6, Pages 1216–1224
(Mi smj2043)
|
|
|
|
This article is cited in 13 scientific papers (total in 13 papers)
List 2-distance $(\Delta+2)$-coloring of planar graphs with girth 6 and $\Delta\ge24$
O. V. Borodina, A. O. Ivanovab a Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
b Institute for Mathematics and Informatics, Yakutsk State University, Yakutsk
Abstract:
It was proved in [1] that every planar graph with girth $g\ge6$ and maximum degree $\Delta\ge8821$ is 2-distance $(\Delta+2)$-colorable. We prove that every planar graph with $g\ge6$ and $\Delta\ge24$ is list 2-distance $(\Delta+2)$-colorable.
Keywords:
planar graph, 2-distance coloring, list coloring.
Received: 11.08.2008
Citation:
O. V. Borodin, A. O. Ivanova, “List 2-distance $(\Delta+2)$-coloring of planar graphs with girth 6 and $\Delta\ge24$”, Sibirsk. Mat. Zh., 50:6 (2009), 1216–1224; Siberian Math. J., 50:6 (2009), 958–964
Linking options:
https://www.mathnet.ru/eng/smj2043 https://www.mathnet.ru/eng/smj/v50/i6/p1216
|
|