An Ore-type theorem on Hamiltonian square cycles
From MaRDI portal
Publication:354425
DOI10.1007/S00373-012-1161-3zbMATH Open1268.05122OpenAlexW1963641871MaRDI QIDQ354425FDOQ354425
Authors: Phong Châu 
Publication date: 19 July 2013
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-012-1161-3
Recommendations
Cites Work
- Proof of the Seymour conjecture for large graphs
- An Ore-type theorem on equitable coloring
- A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
- An Ore-type theorem for perfect packings in graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- How to avoid using the regularity Lemma: Pósa's conjecture revisited
- Note on Hamilton Circuits
- Some Theorems on Abstract Graphs
- Blow-up lemma
- The square of paths and cycles
- Hamiltonian square-paths
- The Square of a Hamiltonian Cycle
- Partitioning a graph into two square-cycles
- On the square of a Hamiltonian cycle in dense graphs
- Pósa's conjecture for graphs of order at least 2 × 108
- Graphs containing every 2-factor
- Ore-type graph packing problems
- Embedding Arbitrary Graphs of Maximum Degree Two
Cited In (10)
- Hamiltonian cycles with all small even chords
- Embedding graphs having Ore-degree at most five
- The Square of a Hamiltonian Cycle
- On degree sequences forcing the square of a Hamilton cycle
- Dirac's condition for spanning Halin subgraphs
- Ore-degree threshold for the square of a Hamiltonian cycle
- On a degree sequence analogue of Pósa's conjecture
- On sufficient conditions for spanning structures in dense graphs
- Minimum Degrees for Powers of Paths and Cycles
- A note on the 2-power of Hamilton cycles
This page was built for publication: An Ore-type theorem on Hamiltonian square cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q354425)
