An Ore-type theorem on Hamiltonian square cycles
From MaRDI portal
Publication:354425
DOI10.1007/s00373-012-1161-3zbMath1268.05122MaRDI QIDQ354425
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
05C45: Eulerian and Hamiltonian graphs
Related Items
Dirac's Condition for Spanning Halin Subgraphs, On sufficient conditions for spanning structures in dense graphs, On a degree sequence analogue of Pósa's conjecture, On Degree Sequences Forcing The Square of a Hamilton Cycle, Embedding Graphs Having Ore-Degree at Most Five
Cites Work
- Unnamed Item
- Unnamed Item
- How to avoid using the regularity Lemma: Pósa's conjecture revisited
- Proof of the Seymour conjecture for large graphs
- Blow-up lemma
- The square of paths and cycles
- Hamiltonian square-paths
- Graphs containing every 2-factor
- An Ore-type theorem on equitable coloring
- Note on Hamilton Circuits
- Ore-type graph packing problems
- A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
- An Ore-type Theorem for Perfect Packings in Graphs
- Embedding Arbitrary Graphs of Maximum Degree Two
- 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
- Some Theorems on Abstract Graphs
