Vertex partitions of \(K_{4,4}\)-minor free graphs
From MaRDI portal
Publication:5943046
DOI10.1007/PL00007245zbMath0973.05069OpenAlexW2066540934MaRDI QIDQ5943046
No author found.
Publication date: 28 November 2001
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00007245
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Graph minors (05C83)
Related Items (6)
Rooted minor problems in highly connected graphs ⋮ Disproof of a conjecture by Woodall on the choosability of \(K_{s,t}\)-minor-free graphs ⋮ The extremal function for Petersen minors ⋮ The extremal function for \(K_{9}\) minors ⋮ Vertex arboricity of integer distance graph \(G(D_{m,k})\) ⋮ List-coloring graphs without \(K_{4,k}\)-minors
This page was built for publication: Vertex partitions of \(K_{4,4}\)-minor free graphs
