Non-separating even cycles in highly connected graphs

DOI10.1007/s00493-010-2482-6zbMath1231.05146OpenAlexW2072784033MaRDI QIDQ653835

Shinya Fujita, Ken-ichi Kawarabayashi

Publication date: 19 December 2011

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-010-2482-6

zbMATH Keywords

separating\(k\)-connectedeven cycle

Mathematics Subject Classification ID

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

Related Items (3)

Negative (and positive) circles in signed graphs: a problem collection ⋮ Negative circles in signed graphs: a problem collection ⋮ What is on his mind?

Cites Work

• A weaker version of Lovász' path removal conjecture
• Cycles in k-connected graphs whose deletion results in a (k-2)-connected graph
• Non-separating paths in 4-connected graphs
• Contractible edges and triangles in \(k\)-connected graphs
• Graph connectivity after path removal
• Induced paths in 5-connected graphs
• Nonseparating cycles inK-Connected graphs
• How to Draw a Graph
• The Erdős-Pósa property for odd cycles in graphs of large connectivity

This page was built for publication: Non-separating even cycles in highly connected graphs