Global insertion and Hamiltonicity in DCT-graphs
From MaRDI portal
Publication:1584209
DOI10.1016/S0012-365X(97)00157-XzbMath0958.05084MaRDI QIDQ1584209
Ahmed Ainouche, Odile Favaron, Hao Li
Publication date: 2 November 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (4)
On 3-connected Hamiltonian line graphs ⋮ Toughness and matching extension in \({\mathcal{P}_3}\)-dominated graphs ⋮ Neighborhood union conditions for Hamiltonicity of \(P_{3}\)-dominated graphs ⋮ On hamiltonicity of \(P_{3}\)-dominated graphs
Cites Work
- Unnamed Item
- Hamiltonism, degree sum and neighborhood intersections
- Quasi-claw-free graphs
- Longest paths and cycles in K1,3-free graphs
- Hamilton cycles in claw-free graphs
- An improvement of fraisse's sufficient condition for hamiltonian graphs
- Graphs with 1-Factors
- 1-Factors and Antifactor Sets
- Almost claw‐free graphs
- Toughness and hamiltonicity in almost claw-free graphs
This page was built for publication: Global insertion and Hamiltonicity in DCT-graphs
