Dynamic coloring of graphs having no \(K_5\) minor

DOI10.1016/j.dam.2016.01.022zbMath1335.05066arXiv1210.2142OpenAlexW2143868017MaRDI QIDQ277625

Younjin Kim, Sang June Lee, Sang-il Oum

Publication date: 2 May 2016

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

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

zbMATH Keywords

four-color theoremHadwiger's conjecturedynamic coloringminor-free graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph minors (05C83) Connectivity (05C40)

Related Items (7)

Dynamic list coloring of 1-planar graphs ⋮ Graph \(r\)-hued colorings -- a survey ⋮ Decomposition and \(r\)-hued coloring of \(K_4(7)\)-minor free graphs ⋮ Weak-dynamic coloring of graphs beyond-planarity ⋮ Unnamed Item ⋮ A counterexample to montgomery's conjecture on dynamic colourings of regular graphs ⋮ The structure and the list 3-dynamic coloring of outer-1-planar graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On dynamic coloring for planar graphs and graphs of higher genus
• On the dynamic coloring of graphs
• Local chromatic number, Ky Fan's theorem, and circular colorings
• On the list dynamic coloring of graphs
• Local coloring of Kneser graphs
• On colorings of graph powers
• A generalization of the Erdős-Ko-Rado theorem
• Coloring graphs with locally few colors
• Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs
• Hadwiger's conjecture for \(K_ 6\)-free graphs
• An improved linear edge bound for graph linkages
• The extremal function for complete minors
• Sperner capacity of small digraphs
• Dynamic coloring and list dynamic coloring of planar graphs
• Colorful subgraphs in Kneser-like graphs
• Conditional colorings of graphs
• Zur Klassifikation der endlichen Graphen nach H. Hadwiger und K. Wagner
• Local chromatic number and Sperner capacity
• On directed local chromatic number, shift graphs, and Borsuk-like graphs
• Local chromatic number and distinguishing the strength of topological obstructions
• The Operator $\Psi$ for the Chromatic Number of a Graph
• Topological cliques in graphs II
• List Dynamic Coloring of Sparse Graphs

This page was built for publication: Dynamic coloring of graphs having no \(K_5\) minor