Existence of polyhedral embeddings of graphs is NP-complete - Mohar, Bojan (Univ. of Ljubljana, Inst. of Mathematics, Physics and Mechanics, Dep. of Mathematics, 1998)