List 2-distance (Δ+2)-coloring of planar graphs with girth six

Authors:
Oleg V. Borodin;Anna O. Ivanova
Affiliations:
Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk, 630090, Russia;Institute of Mathematics at Yakutsk State University, Yakutsk, 677000, Russia
Venue:
European Journal of Combinatorics
Year:
2009

Citing 5
Cited 1

Coloring powers of planar graphs

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Frequency Channel Assignment on Planar Networks

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Coloring Powers of Planar Graphs

SIAM Journal on Discrete Mathematics
A bound on the chromatic number of the square of a planar graph

Journal of Combinatorial Theory Series B
Coloring squares of planar graphs with girth six

European Journal of Combinatorics

Labeling Planar Graphs without 4,5-Cycles with a Condition on Distance Two

SIAM Journal on Discrete Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

It was proved in [Z.Dvorak, D.Kral, P.Nejedly@?, R.Skrekovski, Coloring squares of planar graphs with girth six, European J. Combin. 29 (4) (2008) 838-849] that every planar graph with girth g=6 and maximum degree @D=8821 is 2-distance (@D+2)-colorable. We prove that every planar graph with g=6 and @D=36 is list 2-distance (@D+2)-colorable.