Forbidden subgraphs and the existence of a 2-factor

In 1996, Ota and Tokuda showed that a star-free graph with sufficiently high minimum degree admits a 2-factor. More recently it was shown that the minimum degree condition can be significantly reduced if one also requires that the graph is not only star-free but also of sufficiently high edge-connectivity. In this paper reduce the minimum degree condition further for star-free graphs that also avoid W Mr, where W Mr is the graph K1 + rK2. Keywords. 2-factor, forbidden subgraphs, edge-connectivity

• Type: Journal
• Year: 2010
• Where: JGT
• Authors: Robert E. L. Aldred, Jun Fujisawa, Akira Saito
• Keywords: JGT 2010, Minimum Degree, Minimum Degree Condition, Star-free Graphs