arXiv Analytics

Sign in

arXiv:2310.12283 [math.CO]AbstractReferencesReviewsResources

A characterization of 4-connected graphs with no $K_{3,3}+v$-minor

Linsong Wei, Yuqi Xu, Yunxia Zhang, Weihua Yang

Published 2023-10-17Version 1

Among graphs with 13 edges, there are exactly three internally 4-connected graphs which are $Oct^{+}$, cube+e and $ K_{3,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 $K_{3,3}+v$ denote the graph obtained by adding a new vertex $v$ to $K_{3,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 $K_{3,3}+v$ as a minor.

Related articles: Most relevant | Search more
arXiv:2012.14380 [math.CO] (Published 2020-12-28)
A complete characterization of $(f_0, f_1)$-pairs of 6-polytopes
arXiv:2110.14712 [math.CO] (Published 2021-10-27, updated 2022-01-20)
Complete characterization of the minimal-ABC trees
arXiv:math/9907050 [math.CO] (Published 1999-07-08)
On some extremal problems in graph theory