Claw-free graphs. IV. Decomposition theorem

Research output: Contribution to journalArticle

33 Scopus citations

Abstract

A graph is claw-free if no vertex has three pairwise nonadjacent neighbours. In this series of papers we give a structural description of all claw-free graphs. In this paper, we achieve a major part of that goal; we prove that every claw-free graph either belongs to one of a few basic classes, or admits a decomposition in a useful way.

Original languageEnglish (US)
Pages (from-to)839-938
Number of pages100
JournalJournal of Combinatorial Theory. Series B
Volume98
Issue number5
DOIs
StatePublished - Sep 1 2008

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

Keywords

  • Claw-free graphs
  • Induced subgraphs

Fingerprint Dive into the research topics of 'Claw-free graphs. IV. Decomposition theorem'. Together they form a unique fingerprint.

  • Cite this