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

DOI10.1016/J.DISC.2005.11.052MaRDI QIDQ868356zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Hao Li, Antoni Marczyk, Mariusz Woźniak, 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

Hamiltonian graphscyclability

Mathematics Subject Classification ID

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

Recommendations

• A generalization of a theorem of Dirac
• Cycles through a prescribed vertex set in \(n\)-connected graphs.
• Cycles and paths through specified vertices
• Cycles through k+2 vertices in k-connected graphs
• Cycles passing throughk + 1 vertices ink-connected graphs

Cites work

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

Cited in

(11)

• A generalization of a theorem of Dirac
• scientific article; zbMATH DE number 5994590 (Why is no real title available?)
• Cycles passing throughk + 1 vertices ink-connected graphs
• Cycles through \(k+2\) vertices in \(k\)-connected graphs
• On some cyclic connectivity properties of directed graphs (examples and problems)
• Counterexamples to a conjecture of Mader about cycles through specified vertices in \(n\)-edge-connected graphs
• On the cycle polytope of a directed graph and its relaxations
• An extension of a theorem on cycles containing specified independent edges
• Cycles through a prescribed vertex set in \(n\)-connected graphs.
• Cyclability in \(k\)-connected \(K_{1,4}\)-free graphs
• A Chvátal--Erdős type condition for pancyclability

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

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