Weak dynamic coloring of planar graphs

DOI10.1007/s00373-023-02748-3arXiv1802.05953OpenAlexW2785896737MaRDI QIDQ6121912

Leaha Hand, Paul S. Wenger, Sogol Jahanbekam, Caroline Accurso, Vitaliy Chernyshov

Publication date: 26 March 2024

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1802.05953

zbMATH Keywords

planar graphsextremal problemscoloring of graphs

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On \(r\)-dynamic coloring of graphs
• On the dynamic coloring of graphs
• Dynamic chromatic number of regular graphs
• Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number
• On \(r\)-dynamic chromatic number of graphs
• Every planar map is four colorable. I: Discharging
• A counterexample to montgomery's conjecture on dynamic colourings of regular graphs
• Dynamic coloring and list dynamic coloring of planar graphs

This page was built for publication: Weak dynamic coloring of planar graphs