Claw-free graphs. IV. Decomposition theorem

  • Authors:

  • Maria Chudnovsky;Paul Seymour

  • Affiliations:

  • Columbia University, New York, NY 10027, USA;Princeton University, Princeton, NJ 08544, USA

  • Venue:
  • Journal of Combinatorial Theory Series B
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

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.