We prove that the problem of deciding whether a graph has a balanced skew partition is NP-hard. We give an O(n9)-time … balanced skew partition if it has one. It relies on a new decomposition theorem for Berge graphs, that is more precise than the …

We prove that the problem of deciding whether a graph has a balanced skew partition is NP-hard. We give an O(n9)-time … balanced skew partition if it has one. It relies on a new decomposition theorem for Berge graphs, that is more precise than the …