On Ks,t minors in (s+t)-chromatic graphs

DOI10.1002/jgt.20485zbMath1223.05076OpenAlexW4241456002MaRDI QIDQ3061193

Alexandr V. Kostochka

Publication date: 14 December 2010

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20485

zbMATH Keywords

graph coloringcomplete bipartite graphsgraph minors

Mathematics Subject Classification ID

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

Related Items (3)

Disproof of a conjecture by Woodall on the choosability of \(K_{s,t}\)-minor-free graphs ⋮ On \(K_{s,t}\)-minors in graphs with given average degree. II ⋮ Minors in ‐ Chromatic Graphs, II

Cites Work

• Dense graphs have \(K_{3,t}\) minors
• The extremal function for unbalanced bipartite minors
• Unnamed Item

This page was built for publication: On Ks,t minors in (s+t)-chromatic graphs