A Characterization of Graphs with No Octahedron Minor

Authors


  • Contract grant sponsor: NSA; contract grant number: H98230-10-1-0186; Contract grant sponsor: NSF; contract grant number: DMS-1001230.

Abstract

It is proved that a graph does not contain an octahedron minor if and only if it is constructed from inline image and five other internally 4-connected graphs by 0-, 1-, 2-, and 3-sums.

Ancillary