Zhu, E., Wu, P., & Shao, Z. (2022). Exact algorithms for counting 3-colorings of graphs. Discrete Applied Mathematics, 322, 74-93. https://doi.org/10.1016/j.dam.2022.08.002
Citace podle Chicago (17th ed.)Zhu, Enqiang, Pu Wu, a Zehui Shao. "Exact Algorithms for Counting 3-colorings of Graphs." Discrete Applied Mathematics 322 (2022): 74-93. https://doi.org/10.1016/j.dam.2022.08.002.
Citace podle MLA (9th ed.)Zhu, Enqiang, et al. "Exact Algorithms for Counting 3-colorings of Graphs." Discrete Applied Mathematics, vol. 322, 2022, pp. 74-93, https://doi.org/10.1016/j.dam.2022.08.002.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..