I'm trying to understand the graph genus. I've read some defs, but I still find confusing, how the genus can be reliably counted.
Simplest definition for graph genus?
How about:
Smallest number of holes in the graph possible so that it can be "laid on" a surface of equivalent number of holes?