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

DOI10.1016/0095-8956(87)90053-0zbMATH Open0618.05034OpenAlexW1972837347MaRDI QIDQ1089006FDOQ1089006

Authors: 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

Recommendations

• scientific article; zbMATH DE number 568792
• Contractible triples in highly connected graphs
• Contractible cycles in graphs with girth at least 5
• Nonseparating cycles avoiding specific vertices
• Contractible cycles in graphs with large minimum degree

zbMATH Keywords

connectivity of graphsdeletion of a cycle

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (12)

• Contractible edges and triangles in \(k\)-connected graphs
• Contractible cycles in graphs with girth at least 5
• Nonseparating Induced Cycles Consisting of Contractible Edges in k-Connected Graphs
• Deleting an edge of a 3-cycle in an intrinsically knotted graph gives an intrinsically linked graph
• Contractible cliques in \(k\)-connected graphs
• Title not available (Why is that?)
• Non-separating even cycles in highly connected graphs
• Non-separating subgraphs in highly connected graphs
• What is on his mind?
• Note on non-separating and removable cycles in highly connected graphs
• Nonseparating cycles avoiding specific vertices
• Contractible cycles in graphs with large minimum degree

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1089006)