Skip to main content

All Questions

Filter by
Sorted by
Tagged with
4 votes
2 answers
232 views

Number of non-equivalent graph embeddings

Given a graph $G$, there is a minimal integer $g$ associated with it which captures the minimum genus a surface needs to have so that $G$ embeds in the surface without edge crossings. Is there a way ...