On dynamic coloring for planar graphs and graphs of higher genus
From MaRDI portal
Publication:423914
DOI10.1016/j.dam.2012.01.012zbMath1243.05079MaRDI 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
dynamic chromatic number; \((k, r)\)-coloring; \(r\)-hued chromatic number; dynamic choice number; Heawood coloring theorem
05C10: Planar graphs; geometric and topological aspects of graph theory
05C15: Coloring of graphs and hypergraphs
Related Items
Linear list r-hued coloring of sparse graphs, Dynamic coloring on restricted graph classes, Weak-dynamic coloring of graphs beyond-planarity, Element deletion changes in dynamic coloring of graphs, Dynamic coloring of graphs having no \(K_5\) minor, On \(r\)-hued coloring of \(K_4\)-minor free graphs, Adynamic coloring of graphs, On \(r\)-hued coloring of planar graphs with girth at least 6, On list \(r\)-hued coloring of planar graphs, Dynamic coloring parameters for graphs with given genus, \(r\)-hued coloring of sparse graphs, List \(r\)-hued chromatic number of graphs with bounded maximum average degrees, List \(r\)-dynamic coloring of graphs with small maximum average degree, Upper bounds of \(r\)-hued colorings of planar graphs, 3-dynamic coloring and list 3-dynamic coloring of \(K_{1, 3}\)-free graphs, A counterexample to montgomery's conjecture on dynamic colourings of regular graphs, On \(r\)-hued list coloring of \(K_4 ( 7 )\)-minor free graphs, Graph \(r\)-hued colorings -- a survey, Decomposition and \(r\)-hued coloring of \(K_4(7)\)-minor free graphs, \(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\), List \(r\)-dynamic coloring of sparse graphs, On \(r\)-hued colorings of graphs without short induced paths, Optimal \(r\)-dynamic coloring of sparse graphs, Dynamic coloring and list dynamic coloring of planar graphs, Dynamic list coloring of 1-planar graphs
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
