Hudry, O., & Lobstein, A. (2016). More results on the complexity of identifying problems in graphs. Theoretical computer science, 626, 1-12. https://doi.org/10.1016/j.tcs.2016.01.021
Citace podle Chicago (17th ed.)Hudry, Olivier, a Antoine Lobstein. "More Results on the Complexity of Identifying Problems in Graphs." Theoretical Computer Science 626 (2016): 1-12. https://doi.org/10.1016/j.tcs.2016.01.021.
Citace podle MLA (9th ed.)Hudry, Olivier, a Antoine Lobstein. "More Results on the Complexity of Identifying Problems in Graphs." Theoretical Computer Science, vol. 626, 2016, pp. 1-12, https://doi.org/10.1016/j.tcs.2016.01.021.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..