On the number of maximum genus embeddings of almost all graphs
From MaRDI portal
Publication:1193548
DOI10.1016/0195-6698(92)90043-YzbMath0757.05051MaRDI QIDQ1193548
Publication date: 27 September 1992
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Related Items (5)
A tight lower bound on the maximum genus of a simplicial graph ⋮ Lower bound of the number of maximum genus embeddings and genus embeddings of \(K_{12s+7}\) ⋮ Number of embeddings of circular and Möbius ladders on surfaces ⋮ The maximum genus of graphs with diameter three ⋮ Exponentially many genus embeddings of the complete graph \(K_{12s+3}\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Region distributions of some small diameter graphs
- Region distributions of graph embeddings and Stirling numbers
- Genus distributions for two classes of graphs
- Permutation-partition pairs. III: Embedding distributions of linear families of graphs
- An upper bound for the average number of regions
- How to determine the maximum genus of a graph
- Genus distributions for bouquets of circles
- The nonorientable genus is additive
- The orientable genus is nonadditive
- Hierarchy for imbedding-distribution invariants of a graph
- Enumerating 2-Cell Imbeddings of Connected Graphs
- Permutation-Partition Pairs: A Combinatorial Generalization of Graph Embeddings
- Permutation-Partition Pairs II: Bounds on the Genus of the Amalgamation of Graphs
- A Characterization in of Upper-Embeddable Graphs
- Survey of results on the maximum genus of a graph
- The embeddings of a graph—A survey
This page was built for publication: On the number of maximum genus embeddings of almost all graphs
