Title of article
Traceability in Small Claw-Free Graphs
Author/Authors
Harris، نويسنده , , John M. and Mossinghoff، نويسنده , , Michael J.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2002
Pages
7
From page
358
To page
364
Abstract
We prove that a claw-free, 2-connected graph with fewer than 18 vertices is traceable, and we determine all non-traceable, claw-free, 2-connected graphs with exactly 18 vertices and a minimal number of edges. This complements a result of Matthews on Hamiltonian graphs.
Keywords
Forbidden subgraphs , claw-free , Hamiltonian , traceable
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2002
Journal title
Electronic Notes in Discrete Mathematics
Record number
1453311
Link To Document