A note on 3-distance coloring of planar graphs

DOI10.1007/S41980-023-00848-7MaRDI QIDQ6563283zbMATH OpenFDO

Authors Morteza Hasanvand, Kenta Ozeki

Publication date 27 June 2024

Published in Bulletin of the Iranian Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

planar graphsubcubic graphdischarging methoddistance coloring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Recommendations

• 2-distance 4-coloring of planar subcubic graphs
• 2-distance 4-colorability of planar subcubic graphs with girth at least 22
• 2-distance \((\Delta+2)\)-coloring of sparse planar graphs with \(\Delta=3\)

Cites work

• A bound on the chromatic number of the square of a planar graph
• A unified approach to distance-two colouring of graphs on surfaces
• Brooks' theorem on powers of graphs
• Coloring Powers of Planar Graphs
• Every planar map is four colorable
• List Colouring Squares of Planar Graphs
• List-coloring the square of a subcubic graph
• Map-colour theorem.
• On Representatives of Subsets
• The square of a planar cubic graph is 7-colorable

This page was built for publication: A note on 3-distance coloring of planar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6563283)