Characterizing forbidden pairs for Hamiltonian squares
From MaRDI portal
Publication:897269
DOI10.1007/s00373-015-1524-7zbMath1327.05195arXiv1412.0130OpenAlexW2150681890MaRDI QIDQ897269
Publication date: 17 December 2015
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.0130
Related Items (1)
Cites Work
- Unnamed Item
- How to avoid using the regularity Lemma: Pósa's conjecture revisited
- Characterizing forbidden pairs for hamiltonian properties
- The square of paths and cycles
- Hamiltonian square-paths
- Pancyclicity of 4-connected \{claw, generalized bull\}-free graphs
- The Square of a Hamiltonian Cycle
- Pancyclicity of 4‐Connected, Claw‐Free, P10‐Free Graphs
- On the square of a Hamiltonian cycle in dense graphs
- Pósa's conjecture for graphs of order at least 2 × 108
This page was built for publication: Characterizing forbidden pairs for Hamiltonian squares