Graph minors and linkages
From MaRDI portal
Publication:4680407
Recommendations
Cites work
Cited in
(15)- The extremal function for \(K_{8}^{-}\) minors
- Graph minor theory
- (3,3)-linked planar graphs
- Characterization of \((m, n)\)-linked planar graphs
- A shorter proof of the graph minor algorithm: the unique linkage theorem
- A graph minor condition for graphs to be \(k\)-linked
- Disjoint minimal graphs
- Some recent progress and applications in graph minor theory
- A note on highly connected \(K_{2, \ell}\)-minor free graphs
- Well-Quasi-Ordering Infinite Graphs with Forbidden Finite Planar Minor
- The extremal function for \(K_{9}\) minors
- The extremal function for 3-linked graphs
- On the minor-minimal 2-connected graphs having a fixed minor
- Finding Minors in Graphs with a Given Path Structure
- 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)