Claw-free graphs. V. Global structure

@article{Chudnovsky2008ClawfreeGV,
  title={Claw-free graphs. V. Global structure},
  author={Maria Chudnovsky and Paul D. Seymour},
  journal={J. Comb. Theory, Ser. B},
  year={2008},
  volume={98},
  pages={1373-1410}
}
A graph is claw-free if no vertex has three pairwise nonadjacent neighbours. In earlier papers of this series we proved that every claw-free graph either belongs to one of several basic classes that we described explicitly, or admits one of a few kinds of decomposition. In this paper we convert this “decomposition” theorem into a theorem describing the global structure of claw-free graphs. 
Highly Influential
This paper has highly influenced 10 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

From This Paper

Topics from this paper.
38 Citations
3 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…