Nonseparating Cycles in 4-Connected Graphs

DOI10.1137/S089548010139518XzbMath1029.05082MaRDI QIDQ4443114

Sean Curran, Xingxing Yu

Publication date: 8 January 2004

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

zbMATH Keywords

Hamilton cycledisjoint paths\(k\)-connected graphnonseparating cycle

Mathematics Subject Classification ID

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

Related Items (3)

Independent paths and \(K_{5}\)-subdivisions ⋮ The Kelmans-Seymour conjecture. II: 2-vertices in \(K_4^-\) ⋮ Subdivisions of \(K_5\) in graphs containing \(K_{2,3}\)

This page was built for publication: Nonseparating Cycles in 4-Connected Graphs