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

DOI10.1007/S10878-022-00985-5MaRDI QIDQ2111526zbMATH OpenOpenAlexFDO

Authors Ruiying Yang, Yuehua Bu, Junlei Zhu, Hongguo Zhu

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

\(r\)-dynamic coloringcycledischargingplanar graphs

Mathematics Subject Classification ID

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

Recommendations

• Optimal \(r\)-dynamic coloring of sparse graphs
• List \(r\)-dynamic coloring of sparse graphs
• On \(r\)-dynamic coloring of grids
• Dynamic coloring and list dynamic coloring of planar graphs
• 3-dynamic coloring of planar triangulations

Cites work

• 2-distance coloring of planar graph
• \(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\)
• 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
• Minimum 2-distance coloring of planar graphs and channel assignment
• On \(r\)-hued coloring of planar graphs with girth at least 6
• The \(r\)-dynamic chromatic number of planar graphs without special short cycles
• Upper bounds of r-hued colorings of planar graphs

Cited in

(4)

• Optimal \(r\)-dynamic coloring of sparse graphs
• Dynamic coloring of graphs having no \(K_5\) minor
• scientific article; zbMATH DE number 5079511 (Why is no real title available?)
• 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

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