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 Style (17th ed.) Citationde 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 (9th ed.) Citationde 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.
Warning: These citations may not always be 100% accurate.