K1, 3-factors in graphs

Yoshimi Egawa, Shinya Fujita, Katsuhiro Ota

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)5965-5973
Number of pages9
JournalDiscrete Mathematics
Issue number24
Publication statusPublished - 2008 Dec 28


  • Claw
  • Factor
  • Minimum degree
  • Vertex-disjoint subgraphs

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'K1, 3-factors in graphs'. Together they form a unique fingerprint.

Cite this