Contractible Subgraphs of Contraction Critically Quasi 5-Connected Graphs

2022/06/19 by Shuai Kou, Chengfu Qin, Kou, Shuai +3
Computer Science · Materials Science · Mathematics · #Advanced Graph Theory Research #Advanced Operator Algebra Research #Combinatorics (math.CO) #FOS: Mathematics #Nanocluster Synthesis and Applications

paper · pdf · doi:10.48550/arxiv.2207.13047

openalex publication_date 2022/06/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Let G be a contraction critically quasi 5-connected graph on at least 14 vertices. If there is a vertex x∈ V₄(G) such that G[N_G(x)]≅ K_1,3 or G[N_G(x)]≅ C₄, then G has a quasi 5-contractible subgraph H such that 0<‖V(H)‖<4.

Related

• A forbidden pair for quasi 5-contractible edges
• A degree sum condition for the existence of a quasi 5-contractible edge in a quasi 5-connected graph
• Connectivity of contraction-critical graphs
• A Note on Contractible Edges in Chordal Graphs
• Minimal graphs for contractible and dismantlable properties