Dynamic coloring and list dynamic coloring of planar graphs
From MaRDI portal
Publication:2446867
DOI10.1016/j.dam.2013.03.005zbMath1287.05046MaRDI QIDQ2446867
Won Jin Park, Sang June Lee, Seog-Jin Kim
Publication date: 22 April 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2013.03.005
05C10: Planar graphs; geometric and topological aspects of graph theory
05C15: Coloring of graphs and hypergraphs
Related Items
The structure and the list 3-dynamic coloring of outer-1-planar graphs, Unnamed Item, Dynamic coloring on restricted graph classes, Weak dynamic coloring of planar graphs, Weak-dynamic coloring of graphs beyond-planarity, On r-hued coloring of product graphs, The list \(r\)-hued coloring of \(K_{m, n}\), Element deletion changes in dynamic coloring of graphs, On \(r\)-dynamic coloring of graphs, Dynamic coloring of graphs having no \(K_5\) minor, Adynamic coloring of graphs, On \(r\)-dynamic chromatic number of graphs, Bounds on the dynamic chromatic number of a graph in terms of its chromatic number, 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 3-dynamic coloring of graphs with small maximum average degree, List \(r\)-dynamic coloring of graphs with small maximum average degree, Upper bounds of \(r\)-hued colorings of planar graphs, 3-dynamic coloring of planar triangulations, 3-dynamic coloring and list 3-dynamic coloring of \(K_{1, 3}\)-free graphs, On \(r\)-hued list coloring of \(K_4 ( 7 )\)-minor free graphs, \(r\)-dynamic chromatic number of extended neighborhood corona of complete graph with some graphs, On list \(r\)-hued coloring of outer-1-planar graphs, Graph \(r\)-hued colorings -- a survey, Independent domination, colorings and the fractional idomatic number of a graph, Decomposition and \(r\)-hued coloring of \(K_4(7)\)-minor free graphs, On list 3-dynamic coloring of near-triangulations, \(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\), On dynamic coloring of certain cycle-related graphs, List \(r\)-dynamic coloring of sparse graphs, On \(r\)-dynamic coloring of grids, On \(r\)-hued colorings of graphs without short induced paths, Optimal \(r\)-dynamic coloring of sparse graphs, Dynamic list coloring of 1-planar graphs, Fractional Domatic, Idomatic, and Total Domatic Numbers of a Graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On dynamic coloring for planar graphs and graphs of higher genus
- 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
- Every planar graph is 5-choosable
- Conditional colorings of graphs
- List Dynamic Coloring of Sparse Graphs
