Abstract
Some sufficient conditions (in terms of the girth and maximum degree) are given for the list 2-distance chromatic number of a planar graph with maximum degree Δ to be equal to Δ + 1.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
O. V. Borodin, A. O. Ivanova, and T. K. Neustroeva, “2-Distance Coloring of Sparse Plane Graphs,” Siberian Electronic Math. Reports 1, 76–90 (2004).
O. V. Borodin, A. N. Glebov, A. O. Ivanova, T. K. Neustroeva, and V. A. Tashkinov, “Sufficient Conditions for the 2-Distance (Δ + 1)-Colorability of Plane Graphs,” Siberian Electronic Math. Reports 1, 129–141 (2004).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © O.V. Borodin, A.O. Ivanova, T.K. Neustroeva, 2007, published in Diskretnyi Analiz i Issledovanie Operatsii, Ser. 1, 2007, Vol. 14, No. 3, pp. 13–30.
Rights and permissions
About this article
Cite this article
Borodin, O.V., Ivanova, A.O. & Neustroeva, T.K. List 2-distance (Δ + 1)-coloring of planar graphs with given girth. J. Appl. Ind. Math. 2, 317–328 (2008). https://doi.org/10.1134/S1990478908030034
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1990478908030034