A characterization of 4-connected graphs with no -minor
arXiv:2310.12283
Abstract
Among graphs with 13 edges, there are exactly three internally 4-connected graphs which are , cube+e and . A complete characterization of all 4-connected graphs with no -minor is given in [John Maharry, An excluded minor theorem for the octahedron plus an edge, Journal of Graph Theory 57(2) (2008) 124-130]. Let denote the graph obtained by adding a new vertex to and joining to the four vertices of a 4-cycle. In this paper, we determine all 4-connected graphs that do not contain as a minor.
25