| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4648952 | Discrete Mathematics | 2009 | 6 Pages |
Abstract
Let t≥3t≥3 be an integer. We show that if GG is a 2-connected K1,tK1,t-free graph with minimum degree at least (3t+1)/2(3t+1)/2, then GG has a 4-factor.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Yoshimi Egawa, Keiko Kotani,