Vertex-disjoint claws in graphs

Yoshimi Egawa, Katsuhiro Ota

Research output: Contribution to journalArticlepeer-review

7 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)225-246
Number of pages22
JournalDiscrete Mathematics
Publication statusPublished - 1999 Feb 28


  • Claw
  • Minimum degree
  • Vertex-disjoint subgraphs

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'Vertex-disjoint claws in graphs'. Together they form a unique fingerprint.

Cite this