Recognition of Quasi-Parity and Strict Quasi-Parity Graphs

Can one decide in polynomial time if a given Berge graph is in the class QP, or SQP?

Contributed by Frédéric Maffray




Back to the main index for Perfect Graphs.