Rooted minor problems in highly connected graphs

DOI10.1016/j.disc.2004.07.007zbMath1051.05075OpenAlexW2081145725MaRDI QIDQ1886348

Ken-ichi Kawarabayashi

Publication date: 18 November 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2004.07.007

zbMATH Keywords

connectivityrooted minor

Mathematics Subject Classification ID

Graph minors (05C83) Connectivity (05C40)

Related Items (5)

Rooted \(K_4\)-minors ⋮ Linkless and flat embeddings in 3-space ⋮ Note on coloring graphs without odd-\(K_k\)-minors ⋮ List-coloring graphs without \(K_{4,k}\)-minors ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Forcing unbalanced complete bipartite minors
• On \(K_{s,t}\)-minors in graphs with given average degree
• Linear connectivity forces large complete bipartite minors
• Hadwiger's conjecture for \(K_ 6\)-free graphs
• An improved linear edge bound for graph linkages
• Graph minors. IX: Disjoint crossed paths
• Graph minors. XIII: The disjoint paths problem
• The extremal function for noncomplete minors
• Any 7-chromatic graph has \(K_7\) or \(K_{4,4}\) as a minor
• Highly linked graphs
• Extremal results for rooted minor problems
• Vertex partitions of \(K_{4,4}\)-minor free graphs

This page was built for publication: Rooted minor problems in highly connected graphs