On the complexity of bicoloring clique hypergraphs of graphs

J. Kratochvil, Z. Tuza

Research output: Chapter in Book/Report/Conference proceedingConference contribution

13 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
PublisherSIAM
Pages40-41
Number of pages2
Publication statusPublished - 2000
Event11th Annual ACM-SIAM Symposium on Discrete Algorithms - San Francisco, CA, USA
Duration: Jan 9 2000Jan 11 2000

Other

Other11th Annual ACM-SIAM Symposium on Discrete Algorithms
CitySan Francisco, CA, USA
Period1/9/001/11/00

Fingerprint

Maximal Clique
Hypergraph
Clique
Polynomials
Color
Perfect Graphs
Graph in graph theory
Planar graph
Polynomial time
NP-complete problem

ASJC Scopus subject areas

  • Chemical Health and Safety
  • Software
  • Safety, Risk, Reliability and Quality
  • Discrete Mathematics and Combinatorics

Cite this

Kratochvil, J., & Tuza, Z. (2000). On the complexity of bicoloring clique hypergraphs of graphs. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 40-41). SIAM.

On the complexity of bicoloring clique hypergraphs of graphs. / Kratochvil, J.; Tuza, Z.

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, 2000. p. 40-41.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kratochvil, J & Tuza, Z 2000, On the complexity of bicoloring clique hypergraphs of graphs. in Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, pp. 40-41, 11th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, USA, 1/9/00.
Kratochvil J, Tuza Z. On the complexity of bicoloring clique hypergraphs of graphs. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM. 2000. p. 40-41
Kratochvil, J. ; Tuza, Z. / On the complexity of bicoloring clique hypergraphs of graphs. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, 2000. pp. 40-41
@inproceedings{7dee66c6c1194bd4bf4b36711034a106,
title = "On the complexity of bicoloring clique hypergraphs of graphs",
abstract = "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.",
author = "J. Kratochvil and Z. Tuza",
year = "2000",
language = "English",
pages = "40--41",
booktitle = "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms",
publisher = "SIAM",

}

TY - GEN

T1 - On the complexity of bicoloring clique hypergraphs of graphs

AU - Kratochvil, J.

AU - Tuza, Z.

PY - 2000

Y1 - 2000

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

M3 - Conference contribution

SP - 40

EP - 41

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

PB - SIAM

ER -