TY - JOUR
T1 - K1, 3-factors in graphs
AU - Egawa, Yoshimi
AU - Fujita, Shinya
AU - Ota, Katsuhiro
PY - 2008/12/28
Y1 - 2008/12/28
N2 - Let k be a positive integer. It is shown that if G is a graph of order 4 k with minimum degree at least 2 k, then G contains k vertex-disjoint copies of K1, 3, unless G is isomorphic to K2 k, 2 k with k being odd.
AB - Let k be a positive integer. It is shown that if G is a graph of order 4 k with minimum degree at least 2 k, then G contains k vertex-disjoint copies of K1, 3, unless G is isomorphic to K2 k, 2 k with k being odd.
KW - Claw
KW - Factor
KW - Minimum degree
KW - Vertex-disjoint subgraphs
UR - http://www.scopus.com/inward/record.url?scp=56649114546&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=56649114546&partnerID=8YFLogxK
U2 - 10.1016/j.disc.2007.11.013
DO - 10.1016/j.disc.2007.11.013
M3 - Article
AN - SCOPUS:56649114546
SN - 0012-365X
VL - 308
SP - 5965
EP - 5973
JO - Discrete Mathematics
JF - Discrete Mathematics
IS - 24
ER -