Dynamic coloring of graphs having no \(K_5\) minor
type: Item
instance of: scholarly article
title: Dynamic coloring of graphs having no \(K_5\) minor
zbMATH Open document ID: 1335.05066
author: Younjin Kim
author: Sang June Lee
author: Sang-Il Oum
published in: Discrete Applied Mathematics
publication date: 2016-05-02T00:00:00Z
full work available at URL: https://arxiv.org/abs/1210.2142
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C83
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 6575679
zbMATH Keywords: dynamic coloring
zbMATH Keywords: minor-free graph
zbMATH Keywords: four-color theorem
zbMATH Keywords: Hadwiger's conjecture
MaRDI profile type: Publication
OpenAlex ID: W2143868017
arXiv ID: 1210.2142
cites work: On the list dynamic coloring of graphs
cites work: On the dynamic coloring of graphs
cites work: A generalization of the Erdős-Ko-Rado theorem
cites work: Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs
cites work: On dynamic coloring for planar graphs and graphs of higher genus
cites work: Q3577833
cites work: Coloring graphs with locally few colors
cites work: The Operator $\Psi$ for the Chromatic Number of a Graph
cites work: Q5837979
cites work: On colorings of graph powers
cites work: Zur Klassifikation der endlichen Graphen nach H. Hadwiger und K. Wagner
cites work: Q5539645
cites work: Q4763420
cites work: Dynamic coloring and list dynamic coloring of planar graphs
cites work: List Dynamic Coloring of Sparse Graphs
cites work: Sperner capacity of small digraphs
cites work: Topological cliques in graphs II
cites work: Local chromatic number and Sperner capacity
cites work: Q3333070
cites work: Conditional colorings of graphs
cites work: Q5466088
cites work: Q3428629
cites work: Local coloring of Kneser graphs
cites work: Hadwiger's conjecture for \(K_ 6\)-free graphs
cites work: Local chromatic number, Ky Fan's theorem, and circular colorings
cites work: Colorful subgraphs in Kneser-like graphs
cites work: On directed local chromatic number, shift graphs, and Borsuk-like graphs
cites work: Local chromatic number and distinguishing the strength of topological obstructions
cites work: An improved linear edge bound for graph linkages
cites work: The extremal function for complete minors
DOI: 10.1016/J.DAM.2016.01.022
description: scientific article; zbMATH DE number 6575679