The \(r\)-dynamic chromatic number of planar graphs without 4-,5-cycles

DOI10.1007/s10878-022-00985-5OpenAlexW4313656608MaRDI QIDQ2111526

Ruiying Yang, Hongguo Zhu, Junlei Zhu, Yuehua Bu

Publication date: 17 January 2023

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

Full work available at URL: https://doi.org/10.1007/s10878-022-00985-5

zbMATH Keywords

cycleplanar graphsdischarging\(r\)-dynamic coloring

Mathematics Subject Classification ID

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

Cites Work

• Minimum 2-distance coloring of planar graphs and channel assignment
• On \(r\)-hued coloring of planar graphs with girth at least 6
• List 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six
• List 2-distance \(\varDelta +3\)-coloring of planar graphs without 4,5-cycles
• Upper bounds of \(r\)-hued colorings of planar graphs
• \(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\)
• 2-Distance coloring of planar graph
• The \(r\)-dynamic chromatic number of planar graphs without special short cycles

This page was built for publication: The \(r\)-dynamic chromatic number of planar graphs without 4-,5-cycles