TY - JOUR

T1 - On the complexity of bicoloring clique hypergraphs of graphs

AU - Kratochvil, Jan

AU - Tuza, Zsolt

PY - 2000/1/1

Y1 - 2000/1/1

N2 - Given a graph G, its clique hypergraph C(G) has the same set of vertices as G and the hyperedges correspond to the (inclusionwise) maximal cliques of G. We consider the question of bicolorability of C(G), i.e., whether the vertices of G can be colored with two colors so that no maximal clique is monochromatic. Our two main results say that deciding the bicolorability of C(G) is NP-complete for perfect graphs, but solvable in polynomial time for all planar graphs.

AB - Given a graph G, its clique hypergraph C(G) has the same set of vertices as G and the hyperedges correspond to the (inclusionwise) maximal cliques of G. We consider the question of bicolorability of C(G), i.e., whether the vertices of G can be colored with two colors so that no maximal clique is monochromatic. Our two main results say that deciding the bicolorability of C(G) is NP-complete for perfect graphs, but solvable in polynomial time for all planar graphs.

UR - http://www.scopus.com/inward/record.url?scp=0033879194&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033879194&partnerID=8YFLogxK

U2 - 10.1006/jcis.2000.6789

DO - 10.1006/jcis.2000.6789

M3 - Article

AN - SCOPUS:0033879194

SP - 40

EP - 41

JO - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

JF - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

ER -