Maximum genus and minimum genus embedding in non-orientable surfaces
From MaRDI portal
(Redirected from Publication:3109015)
Recommendations
- Maximum genus embeddings and genus embeddings on orientable surfaces
- Minimum genus embeddings of the complete graph
- Lower bound of the number of maximum genus embeddings and genus embeddings of \(K_{12s+7}\)
- Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs
- Exponentially many maximum genus embeddings and genus embeddings for complete graphs
Cited in
(9)- Exponentially many maximum genus embeddings and genus embeddings for complete graphs
- On the number of maximum genus embeddings of almost all graphs
- Embeddings of one kind of graphs
- Minimum genus embeddings of the complete graph
- Embeddings of nonorientable surfaces with totally reducible focal set
- New methods for finding minimum genus embeddings of graphs on orientable and non-orientable surfaces
- Constructing all minimum genus embeddings of
- Nonorientable strong maximum genus of G(2m+1,m)
- Maximum genus embeddings and genus embeddings on orientable surfaces
This page was built for publication: Maximum genus and minimum genus embedding in non-orientable surfaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3109015)
