| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4650317 | Discrete Mathematics | 2008 | 9 Pages |
Abstract
Let kk be a positive integer. It is shown that if GG is a graph of order 4k4k with minimum degree at least 2k2k, then GG contains kk vertex-disjoint copies of K1,3K1,3, unless GG is isomorphic to K2k,2kK2k,2k with kk being odd.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Yoshimi Egawa, Shinya Fujita, Katsuhiro Ota,