Sciweavers

ENDM
2002
97views more  ENDM 2002»
14 years 8 days ago
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 an...
John M. Harris, Michael J. Mossinghoff
ARSCOM
2004
73views more  ARSCOM 2004»
14 years 10 days ago
2-Factors in Hamiltonian Graphs
We show that every hamiltonian claw-free graph with a vertex x of degree d(x) 7 has a 2-factor consisting of exactly two cycles.
Florian Pfender