On dynamic coloring for planar graphs and graphs of higher genus

DOI10.1016/j.dam.2012.01.012zbMath1243.05079OpenAlexW2155793958MaRDI QIDQ423914

Hong-Jian Lai, Ye Chen, Huimin Song, Suohai Fan, Lei Sun

Publication date: 30 May 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2012.01.012

zbMATH Keywords

dynamic chromatic number\((k, r)\)-coloring\(r\)-hued chromatic numberdynamic choice numberHeawood coloring theorem

Mathematics Subject Classification ID

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

Related Items

Element deletion changes in dynamic coloring of graphs ⋮ Dynamic coloring of graphs having no \(K_5\) minor ⋮ Dynamic list coloring of 1-planar graphs ⋮ Graph \(r\)-hued colorings -- a survey ⋮ Linear list r-hued coloring of sparse graphs ⋮ On list \(r\)-hued coloring of planar graphs ⋮ On \(r\)-hued coloring of \(K_4\)-minor free graphs ⋮ Dynamic coloring parameters for graphs with given genus ⋮ Dynamic coloring on restricted graph classes ⋮ Decomposition and \(r\)-hued coloring of \(K_4(7)\)-minor free graphs ⋮ On \(r\)-hued colorings of graphs without short induced paths ⋮ On \(r\)-hued coloring of planar graphs with girth at least 6 ⋮ Optimal \(r\)-dynamic coloring of sparse graphs ⋮ Weak-dynamic coloring of graphs beyond-planarity ⋮ \(r\)-hued coloring of sparse graphs ⋮ List \(r\)-hued chromatic number of graphs with bounded maximum average degrees ⋮ Dynamic coloring and list dynamic coloring of planar graphs ⋮ \(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\) ⋮ List \(r\)-dynamic coloring of graphs with small maximum average degree ⋮ Upper bounds of \(r\)-hued colorings of planar graphs ⋮ A counterexample to montgomery's conjecture on dynamic colourings of regular graphs ⋮ 3-dynamic coloring and list 3-dynamic coloring of \(K_{1, 3}\)-free graphs ⋮ List \(r\)-dynamic coloring of sparse graphs ⋮ On \(r\)-hued list coloring of \(K_4 ( 7 )\)-minor free graphs ⋮ Adynamic coloring of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dynamic list coloring of bipartite graphs
• On the dynamic coloring of graphs
• On the list dynamic coloring of graphs
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• The four-colour theorem
• Conditional colorings of graphs
• A Six Color Problem

This page was built for publication: On dynamic coloring for planar graphs and graphs of higher genus