On the complexity of bicoloring clique hypergraphs of graphs (extended abstract)

• Authors:

• J. Kratochvil;Zs. Tuza

• Affiliations:

• Department of Applied Mathematics, Charles University, Malostranské nám, 25, 118 00 Prague, Czech Republic;Computer and Automation Institute, Hungarian Academy of Sciences, H-1111 Budapest, Kende u, 13-17, Hungary

• Venue:
• SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
• Year:
• 2000