Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
Open Access
- 1 January 2006
- journal article
- Published by Journal of Graph Algorithms and Applications in Journal of Graph Algorithms and Applications
- Vol. 10 (2) , 353-363