Graph minors and linkages
From MaRDI portal
Publication:4680407
DOI10.1002/JGT.20067zbMATH Open1067.05072OpenAlexW4229667177MaRDI QIDQ4680407FDOQ4680407
Authors: Guantao Chen, Ronald Gould, Ken-ichi Kawarabayashi, Florian Pfender, Bing Wei
Publication date: 1 June 2005
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20067
Recommendations
Cites Work
Cited In (15)
- A graph minor condition for graphs to be \(k\)-linked
- The extremal function for \(K_{8}^{-}\) minors
- Well-Quasi-Ordering Infinite Graphs with Forbidden Finite Planar Minor
- The extremal function for 3-linked graphs
- On the minor-minimal 2-connected graphs having a fixed minor
- Some recent progress and applications in graph minor theory
- The extremal function for \(K_{9}\) minors
- (3,3)-linked planar graphs
- A shorter proof of the graph minor algorithm: the unique linkage theorem
- Graph minor theory
- Disjoint minimal graphs
- A note on highly connected \(K_{2, \ell}\)-minor free graphs
- Finding Minors in Graphs with a Given Path Structure
- Characterization of \((m, n)\)-linked planar graphs
- Connectivity, graph minors, and subgraph multiplicity
This page was built for publication: Graph minors and linkages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4680407)