The \(r\)-dynamic chromatic number of planar graphs without special short cycles

DOI10.1007/978-3-031-16081-3_27zbMath1525.05044OpenAlexW4296168628MaRDI QIDQ6167022

Yuehua Bu, Hongguo Zhu, Ruiying Yang

Publication date: 7 July 2023

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-16081-3_27

zbMATH Keywords

cycleplanar graphdischarging\(r\)-dynamic coloring

Mathematics Subject Classification ID

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

Related Items (1)

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

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 +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\)
• Optimal \(r\)-dynamic coloring of sparse graphs
• 2-Distance coloring of planar graph

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