2-Distance coloring of planar graphs without short cycles

DOI10.1360/012011-695MaRDI QIDQ5017763zbMATH OpenOpenAlexFDO

Authors Yuehua Bu, Xubo Zhu

Publication date 17 December 2021

Published in SCIENTIA SINICA Mathematica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1360/012011-695

zbMATH Keywords

2-distance coloringgirthmaximum degreeplanar graph

Mathematics Subject Classification ID

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

Recommendations

• 2-distance coloring of planar graphs without 4-cycles
• 2-distance coloring of planar graphs without 4-cycles and 5-cycles
• 2-distance coloring of planar graphs without 3, 4, 8-cycles
• 2-distance coloring of a planar graph without 3, 4, 7-cycles
• 2-distance coloring of planar graphs without adjacent 5-cycles
• List 2-distance coloring of planar graphs without short cycles
• 2-Distance coloring of planar graphs without triangles and intersecting 4-cycles
• 2-distance coloring of planar graph
• 2-distance coloring of sparse planar graphs
• 2-distance coloring of sparse planar graphs

Cited in

(18)

• 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\)
• 2-distance coloring of planar graphs with girth 5
• Distance colouring without one cycle length
• 2-distance coloring of sparse planar graphs
• List 2-distance coloring of planar graphs without short cycles
• 2-distance coloring of planar graphs without 4-cycles
• 2-distance coloring of planar graphs without 3, 4, 8-cycles
• 2-distance coloring of a planar graph without 3, 4, 7-cycles
• Distance colouring without one cycle length
• 2-distance coloring of planar graph
• scientific article; zbMATH DE number 7111892 (Why is no real title available?)
• 2-distance coloring of sparse planar graphs
• 2-distance coloring of planar graphs without 4-cycles and 5-cycles
• 2-distance coloring of planar graphs without adjacent 5-cycles
• 2-Distance coloring of planar graphs without triangles and intersecting 4-cycles
• An improved bound for 2-distance coloring of planar graphs with girth six
• Minimum 2-distance coloring of planar graphs and channel assignment
• Distance constrained labelings of planar graphs with no short cycles

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

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