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

DOI10.1007/S10878-022-00985-5OpenAlexW4313656608MaRDI QIDQ2111526FDOQ2111526

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

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

zbMATH Keywords

cycleplanar graphsdischarging\(r\)-dynamic coloring

Mathematics Subject Classification ID

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

Cites Work

• On \(r\)-hued coloring of planar graphs with girth at least 6
• List 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six
• Minimum 2-distance coloring of planar graphs and channel assignment
• \(2\)-distance coloring of planar graph
• 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\)
• The \(r\)-dynamic chromatic number of planar graphs without special short cycles

Cited In (4)

• Dynamic coloring of graphs having no \(K_5\) minor
• Title not available (Why is that?)
• The \(r\)-dynamic chromatic number of planar graphs without special short cycles
• Optimal \(r\)-dynamic coloring of sparse graphs

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)