de Figueiredo, C. M. (2012). The P versus NP–complete dichotomy of some challenging problems in graph theory. Discrete Applied Mathematics, 160(18), 2681-2693. https://doi.org/10.1016/j.dam.2010.12.014
Citace podle Chicago (17th ed.)de Figueiredo, Celina M.H. "The P Versus NP–complete Dichotomy of Some Challenging Problems in Graph Theory." Discrete Applied Mathematics 160, no. 18 (2012): 2681-2693. https://doi.org/10.1016/j.dam.2010.12.014.
Citace podle MLA (9th ed.)de Figueiredo, Celina M.H. "The P Versus NP–complete Dichotomy of Some Challenging Problems in Graph Theory." Discrete Applied Mathematics, vol. 160, no. 18, 2012, pp. 2681-2693, https://doi.org/10.1016/j.dam.2010.12.014.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..