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

Full metadata record

DC Field	Value	Language
dc.contributor.author	Chudnovsky, Maria	-
dc.contributor.author	Seymour, Paul D.	-
dc.date.accessioned	2018-07-20T15:08:23Z	-
dc.date.available	2018-07-20T15:08:23Z	-
dc.date.issued	2012-11	en_US
dc.identifier.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	en_US
dc.identifier.issn	0095-8956	-
dc.identifier.uri	http://arks.princeton.edu/ark:/88435/pr1n08k	-
dc.description.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.	en_US
dc.format.extent	1267 - 1294	en_US
dc.language.iso	en_US	en_US
dc.relation.ispartof	JOURNAL OF COMBINATORIAL THEORY SERIES B	en_US
dc.rights	Final published version. Article is made available in OAR by the publisher's permission or policy.	en_US
dc.title	Claw-free graphs. VII. Quasi-line graphs	en_US
dc.type	Journal Article	en_US
dc.identifier.doi	doi:10.1016/j.jctb.2012.07.005	-
dc.date.eissued	2012-09-03	en_US
pu.type.symplectic	http://www.symplectic.co.uk/publications/atom-terms/1.0/journal-article	en_US

Files in This Item:

File	Description	Size	Format
1-s2.0-S0095895612000524-main.pdf		394.3 kB	Adobe PDF	View/Download