A characterization of \(4\)-connected graphs with no \(K_{3, 3}+v\)-minor
The electronic journal of combinatorics, Tome 32 (2025) no. 3
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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.
DOI : 10.37236/13051
Classification : 05C83, 05C40
Mots-clés : internally 4-connected graphs, weakly 4-connected graphs

Linsong Wei    ; Yuqi Xu  1   ; Weihua Yang  1   ; Yunxia Zhang 

1 Taiyuan University of Technology
@article{10_37236_13051,
     author = {Linsong Wei and Yuqi Xu and Weihua Yang and Yunxia Zhang},
     title = {A characterization of \(4\)-connected graphs with no {\(K_{3,} 3}+v\)-minor},
     journal = {The electronic journal of combinatorics},
     year = {2025},
     volume = {32},
     number = {3},
     doi = {10.37236/13051},
     zbl = {8097665},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/13051/}
}
TY  - JOUR
AU  - Linsong Wei
AU  - Yuqi Xu
AU  - Weihua Yang
AU  - Yunxia Zhang
TI  - A characterization of \(4\)-connected graphs with no \(K_{3, 3}+v\)-minor
JO  - The electronic journal of combinatorics
PY  - 2025
VL  - 32
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.37236/13051/
DO  - 10.37236/13051
ID  - 10_37236_13051
ER  - 
%0 Journal Article
%A Linsong Wei
%A Yuqi Xu
%A Weihua Yang
%A Yunxia Zhang
%T A characterization of \(4\)-connected graphs with no \(K_{3, 3}+v\)-minor
%J The electronic journal of combinatorics
%D 2025
%V 32
%N 3
%U http://geodesic.mathdoc.fr/articles/10.37236/13051/
%R 10.37236/13051
%F 10_37236_13051
Linsong Wei; Yuqi Xu; Weihua Yang; Yunxia Zhang. A characterization of \(4\)-connected graphs with no \(K_{3, 3}+v\)-minor. The electronic journal of combinatorics, Tome 32 (2025) no. 3. doi: 10.37236/13051

Cité par Sources :