Contractible cycles in graphs with large minimum degree

DOI10.1016/S0012-365X(96)00017-9MaRDI QIDQ1363691zbMATHOpenAlexFDO

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

Recommendations

• Contractible cycles in graphs with girth at least 5
• Contractible edges in non-separating cycles
• scientific article; zbMATH DE number 4160775
• Nonseparating Induced Cycles Consisting of Contractible Edges in k-Connected Graphs
• scientific article; zbMATH DE number 5043408

Cites work

• scientific article; zbMATH DE number 4160775 (Why is no real title available?)
• Contractible edges in non-separating cycles
• Cycles in k-connected graphs whose deletion results in a (k-2)-connected graph
• Distribution of contractible edges in k-connected graphs
• Non-separating induced cycles in graphs
• Nonseparating cycles inK-Connected graphs

Cited in

(6)

• Contractible edges in longest cycles in non-Hamiltonian graphs
• Constructive upper bounds for cycle-saturated graphs of minimum size
• Contractible cycles in graphs with girth at least 5
• Cycle contraction in oriented graphs
• Connectivity keeping edges in graphs with large minimum degree
• Cycles in k-connected graphs whose deletion results in a (k-2)-connected graph

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

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