A characterization of 4-connected graphs with no K3,3+v-minor

Abstract

Among graphs with 13 edges, there are exactly three internally 4-connected graphs which are Oct+, cube+e and K3,3 +v. A complete characterization of all 4-connected graphs with no Oct+-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 K3,3+v denote the graph obtained by adding a new vertex v to K3,3 and joining v to the four vertices of a 4-cycle. In this paper, we determine all 4-connected graphs that do not contain K3,3+v as a minor.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…