Coloring perfect graphs with no balanced skew-partitions

Author(s): Chudnovsky, Maria; Trotignon, Nicolas; Trunck, Théophile; Vuskovic, Kristina

Download

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

Full metadata record

DC Field	Value	Language
dc.contributor.author	Chudnovsky, Maria	-
dc.contributor.author	Trotignon, Nicolas	-
dc.contributor.author	Trunck, Théophile	-
dc.contributor.author	Vuskovic, Kristina	-
dc.date.accessioned	2017-04-04T20:17:31Z	-
dc.date.available	2017-04-04T20:17:31Z	-
dc.date.issued	2015-11	en_US
dc.identifier.citation	M. Chudnovsky, N. Trotignon, T. Trunck, K. Vu š kov i ć , Coloring perfect graphs with no balanced skew-partitions, J. Combin. Theory Ser. B 115 (2015) 26–65.	en_US
dc.identifier.uri	http://arks.princeton.edu/ark:/88435/pr1761t	-
dc.description.abstract	We present an $O(n^5)$ algorithm that computes a maximum stable set of any perfect graph with no balanced skew-partition. We present $O(n^7)$ time algorithm that colors them.	en_US
dc.format.extent	26 - 65	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	Coloring perfect graphs with no balanced skew-partitions	en_US
dc.type	Journal Article	en_US
dc.identifier.doi	10.1016/j.jctb.2015.04.007	-
dc.date.eissued	2015-04-29	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
1308.6444v1.pdf		443.71 kB	Adobe PDF	View/Download