K1, 3-factors in graphs

Yoshimi Egawa, Shinya Fujita, Katsuhiro Ota

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

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
Volume308
Issue number24
DOIs
Publication statusPublished - 2008 Dec 28

    Fingerprint

Keywords

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

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Cite this