10 citations · 19 across the 4 of their papers we have counts for
Showing 2013 · cs.DMShow all
2 papers · 2 filters
cs.DM2013★ 6 cited
Clique-Stable Set separation in perfect graphs with no balanced skew-partitions
Aurélie Lagoutte, Théophile Trunck
Inspired by a question of Yannakakis on the Vertex Packing polytope of perfect graphs, we study the Clique-Stable Set Separation in a non-hereditary subclass of perfect graphs. A c…
cs.DM2013★ 10 cited
Coloring perfect graphs with no balanced skew-partitions
Maria Chudnovsky, Nicolas Trotignon, Théophile Trunck +1
We present an algorithm that computes a maximum stable set of any perfect graph with no balanced skew-partition. We present time algorithm that colors them.