Planar embeddability of the vertices of a graph using a fixed point set is NP-hard

Sergio Cabello
2006 Journal of Graph Algorithms and Applications  
doi:10.7155/jgaa.00132 fatcat:lz4mc4xlofc2bhtmgy3cjpulmi