Skip to main content

Claw-free graphs. VII. Quasi-line graphs

Author(s): Chudnovsky, Maria; Seymour, Paul D

Download
To refer to this page use: http://arks.princeton.edu/ark:/88435/pr1n08k
Abstract: A graph is a quasi-line graph if for every vertex v. the set of neighbours of v is expressible as the union of two cliques. Such graphs are more general than line graphs, but less general than claw-free graphs. Here we give a construction for all quasi-line graphs; it turns out that there are basically two kinds of connected quasi-line graphs, one a generalization of line graphs, and the other a subclass of circular arc graphs. (c) 2012 Elsevier Inc. All rights reserved.
Publication Date: Nov-2012
Electronic Publication Date: 3-Sep-2012
Citation: Chudnovsky, Maria, Seymour, Paul. (2012). Claw-free graphs. VII. Quasi-line graphs. JOURNAL OF COMBINATORIAL THEORY SERIES B, 102 (1267 - 1294. doi:10.1016/j.jctb.2012.07.005
DOI: doi:10.1016/j.jctb.2012.07.005
ISSN: 0095-8956
Pages: 1267 - 1294
Type of Material: Journal Article
Journal/Proceeding Title: JOURNAL OF COMBINATORIAL THEORY SERIES B
Version: Final published version. Article is made available in OAR by the publisher's permission or policy.



Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.