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

DOI10.1007/978-3-031-16081-3_27MaRDI QIDQ6167022zbMATH OpenOpenAlexFDO

Authors Yuehua Bu, Ruiying Yang, Hongguo Zhu

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

\(r\)-dynamic coloringcycledischargingplanar graph

Mathematics Subject Classification ID

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

Recommendations

• The \(r\)-dynamic chromatic number of planar graphs without 4-,5-cycles
• Optimal \(r\)-dynamic coloring of sparse graphs
• List \(r\)-dynamic coloring of sparse graphs
• 3-dynamic coloring of planar triangulations
• \(r\)-hued coloring of planar graphs without short cycles

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 +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
• Optimal \(r\)-dynamic coloring of sparse graphs
• Upper bounds of r-hued colorings of planar graphs

Cited in

(2)

• The \(r\)-dynamic chromatic number of planar graphs without 4-,5-cycles
• On r-dynamic chromatic number of some brick product graphs C(2n, 1, p)

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

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