Minimal claw-free graphs

P. Dankelmann, Henda C. Swart, P. Van Den Berg, W. Goddard, M. D. Plummer

Research output: Contribution to journalArticlepeer-review


A graph G is a minimal claw-free graph (m.c.f. graph) if it contains no K1,3 (claw) as an induced subgraph and if, for each edge e of G, G ™ e contains an induced claw. We investigate properties of m.c.f. graphs, establish sharp bounds on their orders and the degrees of their vertices, and characterize graphs which have m.c.f. line graphs.

Original languageEnglish
Pages (from-to)787-798
Number of pages12
JournalCzechoslovak Mathematical Journal
Issue number3
Publication statusPublished - Sept 2008
Externally publishedYes


  • Bow-tie
  • Degree
  • Line graph
  • Minimal claw-free

ASJC Scopus subject areas

  • General Mathematics


Dive into the research topics of 'Minimal claw-free graphs'. Together they form a unique fingerprint.

Cite this