On dynamic coloring for planar graphs and graphs of higher genus

DOI10.1016/J.DAM.2012.01.012MaRDI QIDQ423914zbMATH OpenOpenAlexFDO

Authors Ye Chen, Suohai Fan, Hong-Jian Lai, Huimin Song, 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)

Recommendations

• Dynamic coloring and list dynamic coloring of planar graphs
• Dynamic coloring parameters for graphs with given genus
• On the list dynamic coloring of graphs
• List Dynamic Coloring of Sparse Graphs
• List \(r\)-dynamic coloring of sparse graphs

Cites work

• scientific article; zbMATH DE number 3144962 (Why is no real title available?)
• scientific article; zbMATH DE number 4047749 (Why is no real title available?)
• scientific article; zbMATH DE number 3179262 (Why is no real title available?)
• scientific article; zbMATH DE number 3588683 (Why is no real title available?)
• scientific article; zbMATH DE number 2197944 (Why is no real title available?)
• scientific article; zbMATH DE number 3241107 (Why is no real title available?)
• A Six Color Problem
• Conditional colorings of graphs
• Dynamic list coloring of bipartite graphs
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• Graph theory
• On the dynamic coloring of graphs
• On the list dynamic coloring of graphs
• The four-colour theorem

Cited in

(34)

• 3-dynamic coloring and list 3-dynamic coloring of \(K_{1, 3}\)-free graphs
• Element deletion changes in dynamic coloring of graphs
• Weak-dynamic coloring of graphs beyond-planarity
• On r-hued coloring of K₄-minor free graphs
• Dynamic coloring of graphs having no \(K_5\) minor
• On \(r\)-hued coloring of planar graphs with girth at least 6
• List r-hued chromatic number of graphs with bounded maximum average degrees
• List r-dynamic coloring of graphs with small maximum average degree
• On the list dynamic coloring of graphs
• On \(r\)-hued colorings of graphs without short induced paths
• Dynamic coloring parameters for graphs with given genus
• Dynamic coloring on restricted graph classes
• 3-IC planar graphs are dynamically 9-choosable
• Dynamic coloring and list dynamic coloring of planar graphs
• List 3-dynamic colorings of planar graphs
• Adynamic coloring of graphs
• On list r-hued coloring of planar graphs
• Upper bounds of r-hued colorings of planar graphs
• Upper bound of the list r-hued chromatic number
• A note on the r-hued coloring of planar 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₄(7)-minor free graphs
• The list r-hued coloring of P₅-free graph
• List \(r\)-dynamic coloring of sparse graphs
• List dynamic 4-coloring of planar graphs
• A counterexample to montgomery's conjecture on dynamic colourings of regular graphs
• r-hued coloring of sparse graphs
• Dynamic list coloring of 1-planar graphs
• Dynamic coloring on restricted graph classes
• The r-hued coloring of K₄ (7)-minor free graphs
• Optimal \(r\)-dynamic coloring of sparse graphs
• \(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\)
• Linear list r-hued coloring of sparse graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q423914)