A generalization of Dirac's theorem on cycles through k vertices in k-connected graphs
From MaRDI portal
Publication:868356
DOI10.1016/J.DISC.2005.11.052zbMATH Open1113.05055DBLPjournals/dm/FlandrinLMW07OpenAlexW2035913199WikidataQ59442846 ScholiaQ59442846MaRDI QIDQ868356FDOQ868356
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
Cites Work
- Title not available (Why is that?)
- Note on Hamilton Circuits
- Some Theorems on Abstract Graphs
- 2‐neighborhoods and hamiltonian conditions
- Cycles through specified vertices
- A method in graph theory
- Cycles through subsets with large degree sums
- Cycles through prescribed vertices with large degree sum
- A note on a generalisation of Ore's condition
- In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
- Cycles through given vertices and closures
- Cycles and Connectivity in Graphs
- Cycles and paths through specified vertices in k-connected graphs
- On paths and cycles through specified vertices
- On cycles through specified vertices
- Circuits through prescribed vertices in k‐connected k‐regular graphs
Cited In (9)
- The Parameterized Complexity of Graph Cyclability
- On the cycle polytope of a directed graph and its relaxations
- Cyclability in \(k\)-connected \(K_{1,4}\)-free graphs
- Title not available (Why is that?)
- A Chvátal--Erdős type condition for pancyclability
- Counterexamples to a conjecture of Mader about cycles through specified vertices in \(n\)-edge-connected graphs
- On some cyclic connectivity properties of directed graphs (examples and problems)
- An extension of a theorem on cycles containing specified independent edges
- Cycles passing throughk + 1 vertices ink-connected graphs
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)
