Král, D. and Kratochvíl, J. and Tuza, Zsolt and Woegiger, G. (2001) Complexity of coloring graphs without forbidden induced subgraphs. In: Graph-theoretic concepts in computer science. 27th international workshop. WG 2001 Boltenhagen, 2001. Proceedings. ( Lecture notes in computer science 2204.).

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:07
Last Modified:	11 Dec 2012 15:07
URI:	https://eprints.sztaki.hu/id/eprint/2541

Update Item