It is proved that deciding bicolorability of clique hypergraphs of perfect graphs is NP-complete. A polynomial time algorithm for planar graphs is presented.
