Non-traceability of large connected claw-free graphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199802)27:2<75::AID-JGT3>3.0.CO;2-C" /><75::AID-JGT3>3.0.CO;2-C 10.1002/(SICI)1097-0118(199802)27:2<75::AID-JGT3>3.0.CO;2-CzbMath0888.05041OpenAlexW4250687227MaRDI QIDQ4379733

Zdzisław Skupień, Wacław Frydrych

Publication date: 13 May 1998

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199802)27:2<75::aid-jgt3>3.0.co;2-c

zbMATH Keywords

claw-free graphHamilton pathtraceability

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

A note on degree conditions for traceability in locally claw-free graphs

This page was built for publication: Non-traceability of large connected claw-free graphs