On cycles through specified vertices

DOI10.1016/j.disc.2005.12.021zbMath1091.05038OpenAlexW1982238586MaRDI QIDQ2495522

Michal Tkáč, Jochen Harant, Tobias Gerlach, Frank Göring

Publication date: 30 June 2006

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

Full work available at URL: https://doi.org/10.1016/j.disc.2005.12.021

zbMATH Keywords

connectivitytoughness

Mathematics Subject Classification ID

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

Related Items (2)

Local topological toughness and local factors ⋮ A generalization of Dirac's theorem on cycles through \(k\) vertices in \(k\)-connected graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cycles through specified vertices
• When m vertices in a k-connected graph cannot be walked round along a simple cycle
• A nine point theorem for 3-connected graphs
• Cycles through subsets with large degree sums
• On paths and cycles through specified vertices
• A note on Hamiltonian circuits
• Menger's Theorem
• 4‐chrome Graphen und vollständige 4‐Graphen
• Cycles and Connectivity in Graphs
• On Cycles and Connectivity in Planar Graphs

This page was built for publication: On cycles through specified vertices