An excluded minor theorem for the octahedron

DOI10.1002/(SICI)1097-0118(199906)31:2%3C95::AID-JGT2%3E3.0.CO;2-NMaRDI QIDQ4248533zbMATHOpenAlexFDO

Authors John Maharry

Publication date 10 October 1999

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(199906)31:2%3C95::aid-jgt2%3E3.0.co;2-n

zbMATH Keywords

minorexcluded minoroctahedron

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• An excluded minor theorem for the Octahedron plus an edge
• A characterization of graphs with no octahedron minor
• An included-minor result for 3-connected graphs with contractible edges
• A characterization of graphs with no cube minor

Cites work

• Some Results Concerning the Structure of Graphs

Cited in

(14)

• A chain theorem for 4-connected graphs
• The minimum diameter octagon with unit-length sides: Vincze's wife's octagon is suboptimal
• The octahedron equation implies the cube equation: an elementary proof
• Refining a chain theorem from matroids to internally 4-connected graphs
• Graphs with no \(\bar{P}_7\)-minor
• \(K_{a,k}\) minors in graphs of bounded tree-width
• A characterization of graphs with no octahedron minor
• A characterization of some graph classes using excluded minors
• Some recent progress and applications in graph minor theory
• An excluded minor theorem for the Octahedron plus an edge
• Internally 4-connected graphs with no \(\{\text{cube}, V_8\}\)-minor
• Linear connectivity forces large complete bipartite minors
• Projective-planar graphs with no \(K_{3, 4}\)-minor
• Contractible edges and triangles in \(k\)-connected graphs

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)