Xia, M., Zhang, P., & Zhao, W. (2007). Computational complexity of counting problems on 3-regular planar graphs. Theoretical computer science, 384(1), 111-125. https://doi.org/10.1016/j.tcs.2007.05.023
Citace podle Chicago (17th ed.)Xia, Mingji, Peng Zhang, a Wenbo Zhao. "Computational Complexity of Counting Problems on 3-regular Planar Graphs." Theoretical Computer Science 384, no. 1 (2007): 111-125. https://doi.org/10.1016/j.tcs.2007.05.023.
Citace podle MLA (9th ed.)Xia, Mingji, et al. "Computational Complexity of Counting Problems on 3-regular Planar Graphs." Theoretical Computer Science, vol. 384, no. 1, 2007, pp. 111-125, https://doi.org/10.1016/j.tcs.2007.05.023.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..