Embeddings and the genus of graphs are studied in Section 4.4. It is shown that the genus problem is as difficult as many other well-known hard combinatorial problems. More precisely, the decision ...