Coloring perfect graphs with no balanced skew-partitions

From MaRDI portal
(Redirected from Publication:490982)




Abstract: We present an O(n5) algorithm that computes a maximum stable set of any perfect graph with no balanced skew-partition. We present O(n7) time algorithm that colors them.









This page was built for publication: Coloring perfect graphs with no balanced skew-partitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q490982)