Abstract
Let denote the minimum degree of a graph . We prove that for and , a graph of order at least with contains pairwise vertex-disjoint copies of .
Citation
Shuya Chiba. "Vertex-disjoint -claws in graphs." SUT J. Math. 43 (2) 149 - 172, June 2007. https://doi.org/10.55937/sut/1204832755
Information
Received: 5 June 2007; Published: June 2007
First available in Project Euclid: 18 June 2022
Digital Object Identifier: 10.55937/sut/1204832755
Subjects:
Primary:
05C35
Keywords:
graph
,
minimum degree
,
t-claw
Rights: Copyright © 2007 Tokyo University of Science