Traceability in Small Claw-Free Graphs

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.

• Type: Journal
• Year: 2002
• Where: ENDM
• Authors: John M. Harris, Michael J. Mossinghoff
• Keywords: 2-connected Graphs, Claw-free, ENDM 2002, Minimal Number