List 2-distance coloring of planar graphs

DOI10.1007/s10878-013-9700-2zbMath1326.05044OpenAlexW2086271907MaRDI QIDQ887861

Yuehua Bu, Xiaoyan Yan

Publication date: 3 November 2015

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-013-9700-2

zbMATH Keywords

planar graphs2-distance coloringchoice chromatic numberthe maximum degree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Related Items

List 2-distance coloring of planar graphs without short cycles, 2-Distance coloring of planar graph

Cites Work

• 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\)
• An optimal square coloring of planar graphs
• List \((p,q)\)-coloring of sparse plane graphs
• Choosability of the square of a planar graph with maximum degree four
• Coloring Powers of Planar Graphs
• Labeling Planar Graphs with Conditions on Girth and Distance Two
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item