An excluded minor theorem for the octahedron
From MaRDI portal
Publication:4248533
Recommendations
Cited in
(14)- Contractible edges and triangles in k-connected graphs
- The octahedron equation implies the cube equation: an elementary proof
- Internally 4-connected graphs with no \(\{\text{cube}, V_8\}\)-minor
- Graphs with no \(\bar{P}_7\)-minor
- Linear connectivity forces large complete bipartite minors
- An excluded minor theorem for the Octahedron plus an edge
- A chain theorem for 4-connected graphs
- The minimum diameter octagon with unit-length sides: Vincze's wife's octagon is suboptimal
- \(K_{a,k}\) minors in graphs of bounded tree-width
- Projective-planar graphs with no \(K_{3, 4}\)-minor
- Some recent progress and applications in graph minor theory
- Refining a chain theorem from matroids to internally 4-connected graphs
- A characterization of graphs with no octahedron minor
- A characterization of some graph classes using excluded minors
This page was built for publication: An excluded minor theorem for the octahedron
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4248533)