Edge-colouring eight-regular planar graphs

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

Download

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

Full metadata record

DC Field	Value	Language
dc.contributor.author	Chudnovsky, Maria	-
dc.contributor.author	Edwards, Katherine	-
dc.contributor.author	Seymour, Paul D.	-
dc.date.accessioned	2017-04-04T20:16:39Z	-
dc.date.available	2017-04-04T20:16:39Z	-
dc.date.issued	2015-11	en_US
dc.identifier.citation	M. Chudnovsky, K. Edwards, P. Seymour, Edge-colouring eight-regular planar graphs, J. Combin. Theory Ser. B 115 (2015) 303–338, http://dx.doi.org/10.1016/j.jctb.2015.05.002.	en_US
dc.identifier.uri	http://arks.princeton.edu/ark:/88435/pr1xw34	-
dc.description.abstract	It was conjectured by the third author in about 1973 that every $d$-regular planar graph (possibly with parallel edges) can be $d$-edge-coloured, provided that for every odd set $X$ of vertices, there are at least $d$ edges between $X$ and its complement. For $d = 3$ this is the four-colour theorem, and the conjecture has been proved for all $d\le 7$, by various authors. Here we prove it for $d = 8$.	en_US
dc.format.extent	303–338	en_US
dc.language.iso	en_US	en_US
dc.relation.ispartof	Journal of combinatorial theory. Series B.	en_US
dc.rights	Author's manuscript	en_US
dc.title	Edge-colouring eight-regular planar graphs	en_US
dc.type	Journal Article	en_US
dc.identifier.doi	10.1016/j.jctb.2015.05.002	-
dc.date.eissued	2015-05-18	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
1209.1176v1.pdf		284.13 kB	Adobe PDF	View/Download