Lower bound of the number of maximum genus embeddings and genus embeddings of K₁₂s+7
From MaRDI portal
Publication:659679
Recommendations
- Lower bound on the number of the maximum genus embedding of \(K_{n,n}\)
- Exponentially many genus embeddings of the complete graph \(K_{12s+3}\)
- A note on lower bounds for maximum genus
- Genus bounds for embeddings with large minimum degree and representativity
- On the number of maximum genus embeddings of almost all graphs
- Exponentially many nonisomorphic genus embeddings of \(K_{n,m}\)
- scientific article; zbMATH DE number 1531044
- scientific article; zbMATH DE number 2210738
- Maximum genus of strong embeddings
- Maximum genus embeddings and genus embeddings on orientable surfaces
Cites work
- A new characterization of the maximum genus of a graph
- A note on the number of graceful labellings of paths
- Design and topology
- Graphs on surfaces
- How to determine the maximum genus of a graph
- scientific article; zbMATH DE number 3450230 (Why is no real title available?)
- On the number of maximum genus embeddings of almost all graphs
- Region distributions of some small diameter graphs
- The graph genus problem is NP-complete
- Triangular embeddings of complete graphs from graceful labellings of paths
Cited in
(6)- On the number of maximum genus embeddings of almost all graphs
- Exponentially many genus embeddings of the complete graph \(K_{12s+3}\)
- Maximum genus and minimum genus embedding in non-orientable surfaces
- Total embedding distributions of Ringel ladders
- Nonorientable strong maximum genus of G(2m+1,m)
- Lower bound on the number of the maximum genus embedding of \(K_{n,n}\)
This page was built for publication: Lower bound of the number of maximum genus embeddings and genus embeddings of \(K_{12s+7}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659679)
