Clique covering and degree conditions for Hamiltonicity in claw-free graphs

DOI10.1016/S0012-365X(00)00432-5zbMath0995.05090OpenAlexW1983343203WikidataQ127673910 ScholiaQ127673910MaRDI QIDQ5959092

Hao Li, Odile Favaron, Evelyne Flandrin, Zdeněk Ryjáček

Publication date: 24 October 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00432-5

zbMATH Keywords

claw-free graphHamiltonicityclosureclique covering

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items (9)

Closure for \(\{K_{1,4},K_{1,4} + e\}\)-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 ⋮ Hamiltonicity in 3-connected claw-free graphs ⋮ 2-connected Hamiltonian claw-free graphs involving degree sum of adjacent vertices ⋮ Degree conditions on induced claws ⋮ Normal Eulerian clique-covering and hamiltonicity ⋮ Spanning trails in a 2-connected graph

This page was built for publication: Clique covering and degree conditions for Hamiltonicity in claw-free graphs