Construct a graph as follows. Take a circle, and a collection of intervals from it, no three of which have union the entire circle; take a finite set of points V from the circle; and make a graph with vertex set V in which two vertices are adjacent if they both belong to one of the intervals. Such graphs are "long circular interval graphs," and they form an important subclass of the class of all claw-free graphs. In this paper we characterize them by excluded induced subgraphs. This is a step towards the main goal of this series, to find a structural characterization of all claw-free graphs. This paper also gives an analysis of the connected claw-free graphs G with a clique the deletion of which disconnects G into two parts both with at least two vertices. © 2008 Elsevier Inc. All rights reserved.
Chudnovsky, M., & Seymour, P. (2008). Claw-free graphs. III. Circular interval graphs. Journal of Combinatorial Theory. Series B, 98(4), 812–834. https://doi.org/10.1016/j.jctb.2008.03.001