4-coloring $P_6$-free graphs with no induced 5-cycles

Author(s): Chudnovsky, Maria; Maceli, Peter; Stacho, Juraj; Zhong, Mingxian

Download

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

Full metadata record

DC Field	Value	Language
dc.contributor.author	Chudnovsky, Maria	-
dc.contributor.author	Maceli, Peter	-
dc.contributor.author	Stacho, Juraj	-
dc.contributor.author	Zhong, Mingxian	-
dc.date.accessioned	2017-04-04T20:14:21Z	-
dc.date.available	2017-04-04T20:14:21Z	-
dc.date.issued	2017-03	en_US
dc.identifier.citation	Chudnovsky, Maria, Maceli, Peter, Stacho, Juraj, Zhong, Mingxian. (4-coloring $P_6$-free graphs with no induced 5-cycles	en_US
dc.identifier.uri	http://arks.princeton.edu/ark:/88435/pr1ns4n	-
dc.description.abstract	We show that the 4-coloring problem can be solved in polynomial time for graphs with no induced 5-cycle $C_5$ and no induced 6-vertex path $P_6$.	en_US
dc.format.extent	262-285	en_US
dc.language.iso	en_US	en_US
dc.relation.ispartof	Journal of Graph Theory	en_US
dc.rights	Author's manuscript	en_US
dc.title	4-coloring $P_6$-free graphs with no induced 5-cycles	en_US
dc.type	Journal Article	en_US
dc.identifier.doi	10.1002/jgt.22025	-
dc.date.eissued	2016-02-12	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
1407.2487v1.pdf		300.2 kB	Adobe PDF	View/Download