On paths and cycles through specified vertices

DOI10.1016/j.disc.2003.11.059zbMath1048.05050OpenAlexW2002648124MaRDI QIDQ1883258

Jochen Harant

Publication date: 1 October 2004

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

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

zbMATH Keywords

ConnectivityCyclePathSpecified vertices

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (7)

Local topological toughness and local factors ⋮ A generalization of Dirac's theorem on cycles through \(k\) vertices in \(k\)-connected graphs ⋮ On a cycle through a specified linear forest of a graph ⋮ On short paths through prescribed vertices of a graph ⋮ Relative length of longest paths and longest cycles in triangle-free graphs ⋮ On cycles through specified vertices ⋮ A look at cycles containing specified elements of a graph

Cites Work

• 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
• A note on Hamiltonian circuits
• Menger's Theorem
• 4‐chrome Graphen und vollständige 4‐Graphen
• Unnamed Item
• Unnamed Item

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