2-Distance coloring of planar graph

DOI10.1142/S1793830921500075zbMath1475.05063OpenAlexW3049187461MaRDI QIDQ5012803

Yuehua Bu, Jiao Jiao Cao

Publication date: 25 November 2021

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

Full work available at URL: https://doi.org/10.1142/s1793830921500075

zbMATH Keywords

cyclegirthplanar graph\(2\)-distance coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

The \(r\)-dynamic chromatic number of planar graphs without special short cycles ⋮ 2-Distance coloring of planar graphs without triangles and intersecting 4-cycles ⋮ On d-distance equitable chromatic number of some graphs ⋮ The \(r\)-dynamic chromatic number of planar graphs without 4-,5-cycles

Cites Work

• Unnamed Item
• Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable
• List 2-distance coloring of planar graphs
• 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\)
• List 2-distance \(\varDelta +3\)-coloring of planar graphs without 4,5-cycles
• Planar graphs of girth at least five are square \((\delta + 2)\)-choosable
• 2-distance coloring of planar graphs with girth 5
• A bound on the chromatic number of the square of a planar graph
• List 2-distance coloring of planar graphs without short cycles
• Coloring Powers 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: 2-Distance coloring of planar graph