Rooted minor problems in highly connected graphs
From MaRDI portal
Publication:1886348
DOI10.1016/J.DISC.2004.07.007zbMATH Open1051.05075OpenAlexW2081145725MaRDI QIDQ1886348FDOQ1886348
Authors: 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
Recommendations
Cites Work
- Graph minors. XIII: The disjoint paths problem
- The extremal function for noncomplete minors
- Title not available (Why is that?)
- Forcing unbalanced complete bipartite minors
- On \(K_{s,t}\)-minors in graphs with given average degree
- Hadwiger's conjecture for \(K_ 6\)-free graphs
- An improved linear edge bound for graph linkages
- Highly linked graphs
- Graph minors. IX: Disjoint crossed paths
- Extremal results for rooted minor problems
- Linear connectivity forces large complete bipartite minors
- Any 7-chromatic graph has \(K_7\) or \(K_{4,4}\) as a minor
- Vertex partitions of \(K_{4,4}\)-minor free graphs
Cited In (8)
- Extremal results for rooted minor problems
- Rooted \(K_4\)-minors
- Linkless and flat embeddings in 3-space
- List-coloring graphs without \(K_{4,k}\)-minors
- Forcing a Kr minor by high external connectivity
- Erdős-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing
- Extremal functions for rooted minors
- Note on coloring graphs without odd-\(K_k\)-minors
This page was built for publication: Rooted minor problems in highly connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1886348)
