{"year":"2005","author":[{"first_name":"Artur","last_name":"Czumaj","full_name":"Czumaj, Artur"},{"last_name":"Sohler","full_name":"Sohler, Christian","first_name":"Christian"}],"user_id":"15415","publication_identifier":{"issn":["0304-3975"]},"_id":"18790","status":"public","doi":"10.1016/j.tcs.2004.09.031","date_created":"2020-09-01T14:00:37Z","publication_status":"published","department":[{"_id":"63"}],"citation":{"bibtex":"@article{Czumaj_Sohler_2005, title={Testing hypergraph colorability}, volume={331}, DOI={10.1016/j.tcs.2004.09.031}, number={1}, journal={Theoretical Computer Science}, author={Czumaj, Artur and Sohler, Christian}, year={2005}, pages={37–52} }","ieee":"A. Czumaj and C. Sohler, “Testing hypergraph colorability,” Theoretical Computer Science, vol. 331, no. 1, pp. 37–52, 2005.","ama":"Czumaj A, Sohler C. Testing hypergraph colorability. Theoretical Computer Science. 2005;331(1):37-52. doi:10.1016/j.tcs.2004.09.031","short":"A. Czumaj, C. Sohler, Theoretical Computer Science 331 (2005) 37–52.","apa":"Czumaj, A., & Sohler, C. (2005). Testing hypergraph colorability. Theoretical Computer Science, 331(1), 37–52. https://doi.org/10.1016/j.tcs.2004.09.031","mla":"Czumaj, Artur, and Christian Sohler. “Testing Hypergraph Colorability.” Theoretical Computer Science, vol. 331, no. 1, 2005, pp. 37–52, doi:10.1016/j.tcs.2004.09.031.","chicago":"Czumaj, Artur, and Christian Sohler. “Testing Hypergraph Colorability.” Theoretical Computer Science 331, no. 1 (2005): 37–52. https://doi.org/10.1016/j.tcs.2004.09.031."},"volume":331,"type":"journal_article","date_updated":"2022-01-06T06:53:52Z","page":"37-52","language":[{"iso":"eng"}],"intvolume":" 331","issue":"1","publication":"Theoretical Computer Science","title":"Testing hypergraph colorability"}