List-coloring graphs without \(K_{4,k}\)-minors
type: Item
instance of: scholarly article
title: List-coloring graphs without \(K_{4,k}\)-minors
zbMATH Open document ID: 1173.05321
author: Ken-ichi Kawarabayashi
published in: Discrete Applied Mathematics
publication date: 2009-06-30T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C83
zbMATH DE Number: 5572546
zbMATH Keywords: list-coloring
zbMATH Keywords: Hadwiger's conjecture
MaRDI profile type: Publication
full work available at URL: j.dam.2008.08.015
OpenAlex ID: W2081099898
cites work: Every planar map is four colorable. I: Discharging
cites work: Every planar map is four colorable. II: Reducibility
cites work: Linear connectivity forces large complete bipartite minors
cites work: Q4003200
cites work: A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
cites work: Q5837979
cites work: Vertex partitions of \(K_{4,4}\)-minor free graphs
cites work: Extremal results for rooted minor problems
cites work: Rooted minor problems in highly connected graphs
cites work: Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs
cites work: A relaxed Hadwiger's conjecture for list colorings
cites work: Any 7-chromatic graph has \(K_7\) or \(K_{4,4}\) as a minor
cites work: Forcing unbalanced complete bipartite minors
cites work: Q3333070
cites work: Lower bound of the Hadwiger number of graphs by their average degree
cites work: On \(K_{s,t}\)-minors in graphs with given average degree
cites work: The extremal function for unbalanced bipartite minors
cites work: The extremal function for noncomplete minors
cites work: Graph minors. IX: Disjoint crossed paths
cites work: The four-colour theorem
cites work: Hadwiger's conjecture for \(K_ 6\)-free graphs
cites work: An extremal function for contractions of graphs
cites work: The extremal function for complete minors
cites work: Every planar graph is 5-choosable
cites work: Q4390609
cites work: List colourings of planar graphs
cites work: Über eine Eigenschaft der ebenen Komplexe
cites work: Extremal functions for rooted minors
cites work: Q3035307
cites work: List colourings of graphs
cites work: Defective choosability of graphs with no edge-plus-independent-set minor
DOI: 10.1016/J.DAM.2008.08.015
description: scientific article; zbMATH DE number 5572546