A generalization of Dirac's theorem on cycles through \(k\) vertices in \(k\)-connected graphs

DOI10.1016/j.disc.2005.11.052zbMath1113.05055DBLPjournals/dm/FlandrinLMW07OpenAlexW2035913199WikidataQ59442846 ScholiaQ59442846MaRDI QIDQ868356

Hao Li, Mariusz Woźniak, Antoni Marczyk, Evelyne Flandrin

Publication date: 2 March 2007

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

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

zbMATH Keywords

cyclabilityHamiltonian graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

A Chvátal--Erdős type condition for pancyclability ⋮ Cyclability in \(k\)-connected \(K_{1,4}\)-free graphs ⋮ The Parameterized Complexity of Graph Cyclability

Cites Work

• Unnamed Item
• Cycles through specified vertices
• Cycles and paths through specified vertices in k-connected graphs
• A method in graph theory
• Cycles through subsets with large degree sums
• Cycles through given vertices and closures
• On paths and cycles through specified vertices
• Cycles through prescribed vertices with large degree sum
• A note on a generalisation of Ore's condition
• On cycles through specified vertices
• Note on Hamilton Circuits
• In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
• 2‐neighborhoods and hamiltonian conditions
• Circuits through prescribed vertices in k‐connected k‐regular graphs
• Cycles and Connectivity in Graphs
• Some Theorems on Abstract Graphs

This page was built for publication: A generalization of Dirac's theorem on cycles through \(k\) vertices in \(k\)-connected graphs