Hamilton connectedness and the partially square graphs
From MaRDI portal
Publication:2497487
DOI10.1016/J.DISC.2005.11.021zbMATH Open1103.05045OpenAlexW2006034594MaRDI QIDQ2497487FDOQ2497487
Authors: Ahmed Ainouche, Serge Lapiquonne
Publication date: 4 August 2006
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2005.11.021
Recommendations
Cites Work
- Graph theory
- A note on Hamiltonian circuits
- An improvement of fraisse's sufficient condition for hamiltonian graphs
- Quasi-claw-free graphs
- Hamiltonian paths and hamiltonian connectivity in graphs
- 0-dual closures for several classes of graphs
- Hamiltonicity, neighborhood intersections and the partially square graphs
- Hamiltonism and partially square graphs
- Insertible vertices, neighborhood intersections, and hamiltonicity
Cited In (6)
- Recent advances on the Hamiltonian problem: survey III
- The property of Hamiltonian connectedness in Toeplitz graphs
- Hamiltonian-connectedness of triangulations with few separating triangles
- Title not available (Why is that?)
- Pseudo-Hamiltonian-connected graphs
- Hamiltonicity and the independent sets of partially square graphs
This page was built for publication: Hamilton connectedness and the partially square graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2497487)