On cycles through specified vertices

DOI10.1016/J.DISC.2005.12.021MaRDI QIDQ2495522zbMATH OpenOpenAlexFDO

Authors Tobias Gerlach, Jochen Harant, Michal Tkáč, 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)

Cites work

• scientific article; zbMATH DE number 16299 (Why is no real title available?)
• scientific article; zbMATH DE number 1432797 (Why is no real title available?)
• 4‐chrome Graphen und vollständige 4‐Graphen
• A nine point theorem for 3-connected graphs
• A note on Hamiltonian circuits
• Cycles and Connectivity in Graphs
• Cycles through specified vertices
• Cycles through subsets with large degree sums
• Long paths and cycles through specified vertices in \(k\)-connected graphs.
• Menger's theorem
• On Cycles and Connectivity in Planar Graphs
• On paths and cycles through specified vertices
• When m vertices in a k-connected graph cannot be walked round along a simple cycle

Cited in

(5)

• A generalization of Dirac's theorem on cycles through k vertices in k-connected graphs
• Cycles through given vertices and closures
• Edge disjoint cycles through specified vertices
• Long cycles through specified vertices
• Local topological toughness and local factors

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

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