Contractible cycles in graphs with girth at least 5

DOI10.1006/JCTB.1998.1844zbMath1029.05083OpenAlexW2093499999MaRDI QIDQ1569031

Yoshimi Egawa

Publication date: 25 June 2000

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

Full work available at URL: https://doi.org/10.1006/jctb.1998.1844

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (5)

Nonseparating Cycles Avoiding Specific Vertices ⋮ Contractible triples in highly connected graphs ⋮ What is on his mind? ⋮ Note on non-separating and removable cycles in highly connected graphs ⋮ Unnamed Item

Cites Work

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

This page was built for publication: Contractible cycles in graphs with girth at least 5