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.
- Minimum degree
- Vertex-disjoint subgraphs
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics