Cycles in k-connected graphs whose deletion results in a (k-2)-connected graph

DOI10.1016/0095-8956(87)90053-0zbMath0618.05034OpenAlexW1972837347MaRDI QIDQ1089006

Yoshimi Egawa

Publication date: 1987

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(87)90053-0

zbMATH Keywords

connectivity of graphsdeletion of a cycle

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40)

Related Items (10)

Contractible cliques in \(k\)-connected graphs ⋮ Nonseparating Cycles Avoiding Specific Vertices ⋮ Contractible cycles in graphs with large minimum degree ⋮ Non-separating subgraphs in highly connected graphs ⋮ Non-separating even cycles in highly connected graphs ⋮ What is on his mind? ⋮ Note on non-separating and removable cycles in highly connected graphs ⋮ Unnamed Item ⋮ Contractible cycles in graphs with girth at least 5 ⋮ Contractible edges and triangles in \(k\)-connected graphs

Cites Work

• Contractible edges in triangle-free graphs
• Non-separating induced cycles in graphs
• Nonseparating cycles inK-Connected graphs

This page was built for publication: Cycles in k-connected graphs whose deletion results in a (k-2)-connected graph