Three-colourable perfect graphs without even pairs

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

Download

To refer to this page use: http://arks.princeton.edu/ark:/88435/pr1m673

Full metadata record

DC Field	Value	Language
dc.contributor.author	Chudnovsky, Maria	-
dc.contributor.author	Seymour, Paul D.	-
dc.date.accessioned	2018-07-20T15:11:19Z	-
dc.date.available	2018-07-20T15:11:19Z	-
dc.date.issued	2012-03	en_US
dc.identifier.citation	Chudnovsky, Maria, Seymour, Paul. (2012). Three-colourable perfect graphs without even pairs. JOURNAL OF COMBINATORIAL THEORY SERIES B, 102 (363 - 394. doi:10.1016/j.jctb.2011.11.005	en_US
dc.identifier.issn	0095-8956	-
dc.identifier.uri	http://arks.princeton.edu/ark:/88435/pr1m673	-
dc.description.abstract	We still do not know how to construct the “most general” perfect graph, not even the most general three-colourable perfect graph. But constructing all perfect graphs with no even pairs seems easier, and here we make a start on it; we construct all three-connected three-colourable perfect graphs without even pairs and without clique cutsets. They are all either line graphs of bipartite graphs, or complements of such graphs. (C) 2012 Elsevier Inc. All rights reserved.	en_US
dc.format.extent	363 - 394	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	Three-colourable perfect graphs without even pairs	en_US
dc.type	Journal Article	en_US
dc.identifier.doi	doi:10.1016/j.jctb.2011.11.005	-
dc.date.eissued	2012-01-10	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-S0095895611001249-main.pdf		427.46 kB	Adobe PDF	View/Download