On the complexity of bicoloring clique hypergraphs of graphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2000, Pages 40-41

  Kratochvil, Jan ^a   Tuza, Zsolt ^b  

^a CHARLES UNIVERSITY   (Czech Republic)

^b INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; THEOREM PROVING;

BICOLORABILITY; CLIQUE HYPERGRAPHS;

GRAPH THEORY;

EID: 0033879194     PISSN: None     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (0)