Topic summary
Graph genus
Extracted from the Wikipedia article Graph embedding.
Computational complexity
The problem of finding the graph genus is NP-hard (the problem of determining whether an -vertex graph has genus is NP-complete).
Topic summary
Extracted from the Wikipedia article Graph embedding.
The problem of finding the graph genus is NP-hard (the problem of determining whether an -vertex graph has genus is NP-complete).
