Hoàng, C. T., Kamiński, M., Lozin, V., Sawada, J., & Shu, X. (2010). Deciding k-Colorability of P 5-Free Graphs in Polynomial Time. Algorithmica, 57(1), 74-81. https://doi.org/10.1007/s00453-008-9197-8
Citace podle Chicago (17th ed.)Hoàng, Chính T., Marcin Kamiński, Vadim Lozin, Joe Sawada, a Xiao Shu. "Deciding K-Colorability of P 5-Free Graphs In Polynomial Time." Algorithmica 57, no. 1 (2010): 74-81. https://doi.org/10.1007/s00453-008-9197-8.
Citace podle MLA (9th ed.)Hoàng, Chính T., et al. "Deciding K-Colorability of P 5-Free Graphs In Polynomial Time." Algorithmica, vol. 57, no. 1, 2010, pp. 74-81, https://doi.org/10.1007/s00453-008-9197-8.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..