A Characterization of $4$-Connected Graphs with no $ K_{3,3}+v $-Minor

  • Linsong Wei
  • Yuqi Xu
  • Weihua Yang
  • Yunxia Zhang

Abstract

Let $ K_{3,3}+v $ be 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 characterize all $ 4 $-connected graphs that do not contain $ K_{3,3}+v $ as a minor.

Published
2025-08-22
How to Cite
Wei, L., Xu, Y., Yang, W., & Zhang, Y. (2025). A Characterization of $4$-Connected Graphs with no $ K_{3,3}+v $-Minor. The Electronic Journal of Combinatorics, 32(3), P3.37. https://doi.org/10.37236/13051
Article Number
P3.37