A note on degree conditions for Hamiltonicity in 2-connected claw-free graphs
From MaRDI portal
Publication:1349096
DOI10.1016/S0012-365X(01)00088-7zbMath0992.05051MaRDI QIDQ1349096
Ondřej Kovářík, Miloš Mulač, Zdeněk Ryjáček
Publication date: 21 May 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)
Related Items (10)
Closure for \(\{K_{1,4},K_{1,4} + e\}\)-free graphs ⋮ On cycle-nice claw-free graphs ⋮ Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs ⋮ Degree and neighborhood conditions for Hamiltonicity of claw-free graphs ⋮ Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs ⋮ A note on degree conditions for traceability in locally claw-free graphs ⋮ Hamiltonicity in 3-connected claw-free graphs ⋮ 2-connected Hamiltonian claw-free graphs involving degree sum of adjacent vertices ⋮ Degree conditions on induced claws ⋮ Spanning trails in a 2-connected graph
This page was built for publication: A note on degree conditions for Hamiltonicity in 2-connected claw-free graphs
