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
Chicago-Zitierstil (17. Ausg.)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.
MLA-Zitierstil (9. Ausg.)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.
Achtung: Diese Zitate sind unter Umständen nicht zu 100% korrekt.