APA (7th ed.) Citation

Cohen, E., & Tarsi, M. (1991). NP-Completeness of graph decomposition problems. Journal of Complexity, 7(2), 200-212. https://doi.org/10.1016/0885-064X(91)90006-J

Chicago Style (17th ed.) Citation

Cohen, Edith, and Michael Tarsi. "NP-Completeness of Graph Decomposition Problems." Journal of Complexity 7, no. 2 (1991): 200-212. https://doi.org/10.1016/0885-064X(91)90006-J.

MLA (9th ed.) Citation

Cohen, Edith, and Michael Tarsi. "NP-Completeness of Graph Decomposition Problems." Journal of Complexity, vol. 7, no. 2, 1991, pp. 200-212, https://doi.org/10.1016/0885-064X(91)90006-J.