Contractible cycles in graphs with large minimum degree

DOI10.1016/S0012-365X(96)00017-9zbMath0883.05090OpenAlexW2023639312MaRDI QIDQ1363691

Yoshimi Egawa

Publication date: 10 August 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00017-9

zbMATH Keywords

minimum degree\(k\)-connected graphcontractible cycles

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items

Connectivity keeping edges in graphs with large minimum degree ⋮ Contractible cycles in graphs with girth at least 5

Cites Work

• Unnamed Item
• Cycles in k-connected graphs whose deletion results in a (k-2)-connected graph
• Non-separating induced cycles in graphs
• Contractible edges in non-separating cycles
• Distribution of contractible edges in k-connected graphs
• Nonseparating cycles inK-Connected graphs

This page was built for publication: Contractible cycles in graphs with large minimum degree