Testing hypergraph colorability
A. Czumaj, C. Sohler, Theoretical Computer Science 331 (2005) 37–52.
Download
No fulltext has been uploaded.
Journal Article
| Published
| English
Author
Czumaj, Artur;
Sohler, Christian
Publishing Year
Journal Title
Theoretical Computer Science
Volume
331
Issue
1
Page
37-52
ISSN
LibreCat-ID
Cite this
Czumaj A, Sohler C. Testing hypergraph colorability. Theoretical Computer Science. 2005;331(1):37-52. doi:10.1016/j.tcs.2004.09.031
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
@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} }
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.
A. Czumaj and C. Sohler, “Testing hypergraph colorability,” Theoretical Computer Science, vol. 331, no. 1, pp. 37–52, 2005.
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.
Google Scholar