List-coloring graphs without \(K_{4,k}\)-minors
From MaRDI portal
Publication:1028458
DOI10.1016/j.dam.2008.08.015zbMath1173.05321OpenAlexW2081099898MaRDI QIDQ1028458
Publication date: 30 June 2009
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2008.08.015
Related Items
Disproof of a conjecture by Woodall on the choosability of \(K_{s,t}\)-minor-free graphs, On group choosability of graphs. II
Cites Work
- List colourings of planar graphs
- Forcing unbalanced complete bipartite minors
- Lower bound of the Hadwiger number of graphs by their average degree
- A relaxed Hadwiger's conjecture for list colorings
- On \(K_{s,t}\)-minors in graphs with given average degree
- Linear connectivity forces large complete bipartite minors
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- Hadwiger's conjecture for \(K_ 6\)-free graphs
- Every planar graph is 5-choosable
- The four-colour theorem
- The extremal function for unbalanced bipartite minors
- Graph minors. IX: Disjoint crossed paths
- The extremal function for complete minors
- Rooted minor problems in highly connected graphs
- The extremal function for noncomplete minors
- Any 7-chromatic graph has \(K_7\) or \(K_{4,4}\) as a minor
- Über eine Eigenschaft der ebenen Komplexe
- Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs
- An extremal function for contractions of graphs
- Extremal functions for rooted minors
- Defective choosability of graphs with no edge-plus-independent-set minor
- Extremal results for rooted minor problems
- A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
- Vertex partitions of \(K_{4,4}\)-minor free graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
