On the complexity of bicoloring clique hypergraphs of graphs


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… (More)
DOI: 10.1016/S0196-6774(02)00221-3

3 Figures and Tables


  • Presentations referencing similar topics