TY - JOUR
T1 - Vertex-disjoint claws in graphs
AU - Egawa, Yoshimi
AU - Ota, Katsuhiro
PY - 1999/2/28
Y1 - 1999/2/28
N2 - Let δ(G) denote the minimum degree of a graph G. We prove that a graph G of order at least 4k + 6 with δ(G) ≥ k + 2 contains k pairwise vertex-disjoint K1,3's. The conditions on the minimum degree and on the order of the graph are best possible in a sense.
AB - Let δ(G) denote the minimum degree of a graph G. We prove that a graph G of order at least 4k + 6 with δ(G) ≥ k + 2 contains k pairwise vertex-disjoint K1,3's. The conditions on the minimum degree and on the order of the graph are best possible in a sense.
KW - Claw
KW - Minimum degree
KW - Vertex-disjoint subgraphs
UR - http://www.scopus.com/inward/record.url?scp=0142115224&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0142115224&partnerID=8YFLogxK
U2 - 10.1016/s0012-365x(99)90069-9
DO - 10.1016/s0012-365x(99)90069-9
M3 - Article
AN - SCOPUS:0142115224
SN - 0012-365X
VL - 197-198
SP - 225
EP - 246
JO - Discrete Mathematics
JF - Discrete Mathematics
ER -