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 we reduce the minimum degree condition further for star-free graphs that also avoid W Mr, where W Mr is the graph K1 + rK2.
|Number of pages||12|
|Journal||Australasian Journal of Combinatorics|
|Publication status||Published - 2009 Jun 1|
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics