Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4657274 | Journal of Combinatorial Theory, Series B | 2008 | 38 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics