Claw-free graphs. III. Circular interval graphs

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

Citing 1
Cited 7

Claw-free graphs. IV. Decomposition theorem

Journal of Combinatorial Theory Series B

Claw-free graphs. IV. Decomposition theorem

Journal of Combinatorial Theory Series B
Claw-free graphs. V. Global structure

Journal of Combinatorial Theory Series B
Independent Sets of Maximum Weight in Apple-Free Graphs

SIAM Journal on Discrete Mathematics
Claw-free graphs with strongly perfect complements. Fractional and integral version. Part I. Basic graphs

Discrete Applied Mathematics
Dominating set is fixed parameter tractable in claw-free graphs

Theoretical Computer Science
On the facets of the stable set polytope of quasi-line graphs

Operations Research Letters
A proof of a conjecture on diameter 2-critical graphs whose complements are claw-free

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.