2-distance coloring of planar graphs without adjacent 5-cycles

DOI10.1007/S10878-023-01053-2OpenAlexW4381336048MaRDI QIDQ6166190FDOQ6166190

Authors: Yuehua Bu, Zewei Zhang, Hongguo Zhu 

Publication date: 2 August 2023

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

Full work available at URL: https://doi.org/10.1007/s10878-023-01053-2

Recommendations

• \(2\)-distance coloring of planar graph
• 2-Distance coloring of planar graphs without short cycles
• 2-distance coloring of a planar graph without 3, 4, 7-cycles
• 2-distance coloring of planar graphs without 3, 4, 8-cycles
• 2-distance coloring of planar graphs without 4-cycles

zbMATH Keywords

cyclegirthplanar graph2-distance coloring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Cites Work

• 2-distance coloring of planar graphs with girth 5
• List 2-distance coloring of planar graphs with girth five
• A bound on the chromatic number of the square of a planar graph
• Labeling Planar Graphs with Conditions on Girth and Distance Two
• Coloring the square of a planar graph
• Planar graphs of girth at least five are square \((\delta + 2)\)-choosable
• Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable
• List Colouring Squares of Planar Graphs
• The square of a planar cubic graph is 7-colorable

Cited In (4)

• 2-Distance coloring of planar graphs without short cycles
• The 2-distance chromatic number of planar graphs without 3,4,8-cycles
• Planar graphs without adjacent cycles of length at most five are (2, 0, 0)-colorable
• Title not available (Why is that?)

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

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