CABELLO, Sergio. Planar embeddability of the vertices of a graph using a fixed point set is NP-hard. Journal of Graph Algorithms and Applications, [S. l.], v. 10, n. 2, p. 353–363, 2006. DOI: 10.7155/jgaa.00132. Disponível em: https://jgaa.info/index.php/jgaa/article/view/paper132. Acesso em: 30 jun. 2024.