Wheel-free planar graphs

Author(s): Aboulker, Pierre; Chudnovsky, Maria; Seymour, Paul D.; Trotignon, Nicolas

Download

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

Full metadata record

DC Field	Value	Language
dc.contributor.author	Aboulker, Pierre	-
dc.contributor.author	Chudnovsky, Maria	-
dc.contributor.author	Seymour, Paul D.	-
dc.contributor.author	Trotignon, Nicolas	-
dc.date.accessioned	2017-04-04T20:16:21Z	-
dc.date.available	2017-04-04T20:16:21Z	-
dc.date.issued	2015-10	en_US
dc.identifier.citation	Aboulker, Pierre, Chudnovsky, Maria, Seymour, Paul, Trotignon, Nicolas. (2015). Wheel-free planar graphs. European Journal of Combinatorics, 49 (57 - 67). doi:10.1016/j.ejc.2015.02.027	en_US
dc.identifier.issn	0195-6698	-
dc.identifier.uri	http://arks.princeton.edu/ark:/88435/pr1v60m	-
dc.description.abstract	A wheel is a graph formed by a chordless cycle CC and a vertex uu not in CC that has at least three neighbors in CC. We prove that every 3-connected planar graph that does not contain a wheel as an induced subgraph is either a line graph or has a clique cutset. We prove that every planar graph that does not contain a wheel as an induced subgraph is 3-colorable.	en_US
dc.format.extent	57 - 67	en_US
dc.language.iso	en_US	en_US
dc.relation.ispartof	European Journal of Combinatorics	en_US
dc.rights	Author's manuscript	en_US
dc.title	Wheel-free planar graphs	en_US
dc.type	Journal Article	en_US
dc.identifier.doi	doi:10.1016/j.ejc.2015.02.027	-
dc.date.eissued	2015-03-20	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
1309.7120v2.pdf		318.88 kB	Adobe PDF	View/Download