We prove that deciding bicolorability of clique hypergraphs of perfect graphs is NP-complete, but solvable in polynomial time for planar graphs.
