Contents

-

2-Factors in Hamiltonian Graphs

Florian Pfender1
1Department of Mathematics and Computer Science, Emory University, Atlanta, GA 30322,

Abstract

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.