A characterization of 4-connected graphs with no $K_{3,3}+v$-minor
Combinatorics
2023-10-23 v2
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.
Cite
@article{arxiv.2310.12283,
title = {A characterization of 4-connected graphs with no $K_{3,3}+v$-minor},
author = {Linsong Wei and Yuqi Xu and Weihua Yang and Yunxia Zhang},
journal= {arXiv preprint arXiv:2310.12283},
year = {2023}
}
Comments
25