List 2-distance coloring of planar graphs without short cycles

DOI10.1142/S1793830916500130zbMath1333.05085MaRDI QIDQ2798330

Chunhui Shang, Yuehua Bu

Publication date: 12 April 2016

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

cyclesplanar graphmaximum degreelist 2-distance coloring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Vertex degrees (05C07)

Related Items (7)

2-distance list \((\Delta +2)\)-coloring of planar graphs with girth at least 10 ⋮ Graph \(r\)-hued colorings -- a survey ⋮ A new result of list 2-distance coloring of planar graphs with g(G) ≥ 5 ⋮ 2-Distance coloring of planar graphs without triangles and intersecting 4-cycles ⋮ Coloring squares of planar graphs with maximum degree at most five ⋮ \(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\) ⋮ 2-Distance coloring of planar graph

Cites Work

• List 2-distance coloring of planar graphs
• An optimal square coloring of planar graphs
• A bound on the chromatic number of the square of a planar graph
• List Colouring Squares of Planar Graphs
• Labeling Planar Graphs with Conditions on Girth and Distance Two
• Coloring the square of a planar graph

This page was built for publication: List 2-distance coloring of planar graphs without short cycles