×

zbMATH — the first resource for mathematics

List 2-distance \((\Delta + 2)\)-coloring of planar graphs with girth 6 and \(\Delta\geq 24\). (Russian, English) Zbl 1224.05159
Sib. Mat. Zh. 50, No. 6, 1216-1224 (2009); translation in Sib. Math. J. 50, No. 6, 958-964 (2009).
Summary: It was proved in [Z. Dvořák, D. Král’, P. Nejedlý and R. Škrekovski, Eur. J. Comb. 29, No. 4, 838–849 (2008; Zbl 1143.05027)] that every planar graph with girth \(g\geq 6\) and maximum degree \(\Delta\geq 8821\) is 2-distance \((\Delta+2)\)-colourable. We prove that every planar graph with \(g\geq 6\) and \(\Delta\geq 24\) is list 2-distance \((\Delta+2)\)-colourable.

MSC:
05C15 Coloring of graphs and hypergraphs
05C10 Planar graphs; geometric and topological aspects of graph theory
Citations:
Zbl 1143.05027
PDF BibTeX XML Cite
Full Text: EuDML EMIS