Coloring perfect graphs with no balanced skew-partitions

Maria Chudnovsky, Nicolas Trotignon, Théophile Trunck +1

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.