Kratochvíl, J. and Tuza, Zsolt (2000) On the complexity of bicoloring clique hypergraphs of graphs. (Extended abstract). In: Proceedings of the eleventh annual ACM-SIAM Symposium on discrete algorithms. San Francisco, 2000..

Full text not available from this repository.

Item Type:	Conference or Workshop Item (Paper)
Subjects:	Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Divisions:	Systems and Control Lab
Depositing User:	Eszter Nagy
Date Deposited:	11 Dec 2012 15:06
Last Modified:	11 Dec 2012 15:06
URI:	https://eprints.sztaki.hu/id/eprint/2261

Update Item