Hamilton connectedness and the partially square graphs
From MaRDI portal
Publication:2497487
Let \(G\) be a \(k\)-connected graph. The authors use the notions of a partially sqauare graph \(G^*\) of \(G\) and a quasi-claw-free graph. They prove that a \(k\)-connected graph \(G\) \((k\geq 3)\) is either Hamiltonian-connected or the independence number of \(G^*\) is at least \(k\). The authors also give a positive answer to two open problems from the literature.
Recommendations
Cites work
- 0-dual closures for several classes of graphs
- A note on Hamiltonian circuits
- An improvement of fraisse's sufficient condition for hamiltonian graphs
- Graph theory
- Hamiltonian paths and hamiltonian connectivity in graphs
- Hamiltonicity, neighborhood intersections and the partially square graphs
- Hamiltonism and partially square graphs
- Insertible vertices, neighborhood intersections, and hamiltonicity
- Quasi-claw-free graphs
Cited in
(7)- Hamiltonism and partially square graphs
- Pseudo-Hamiltonian-connected graphs
- The property of Hamiltonian connectedness in Toeplitz graphs
- Recent advances on the Hamiltonian problem: survey III
- Hamiltonian-connectedness of triangulations with few separating triangles
- Hamiltonicity and the independent sets of partially square graphs
- scientific article; zbMATH DE number 3946176 (Why is no real title available?)
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)