A graph is called K1, n-free if it contains no K1, n as an induced subgraph. Let n(≥ 3), r be integers (if r is odd, r ≥ n - 1). We prove that every K1, n-free connected graph G with r|V(G)| even has an r-factor if its minimum degree is at least (n + n-1/r) ⌈n/2(n - 1) r⌉ - n - 1/r (⌈n/2(n - 1) r⌉)2 + n - 3. This degree condition is sharp.
|ジャーナル||Journal of Graph Theory|
|出版ステータス||Published - 1996 5月|
ASJC Scopus subject areas