Exponentially many maximum genus embeddings and genus embeddings for complete graphs
From MaRDI portal
Publication:1042786
DOI10.1007/s11425-007-0194-1zbMath1182.05044OpenAlexW2087944085MaRDI QIDQ1042786
Publication date: 7 December 2009
Published in: Science in China. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11425-007-0194-1
Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items
On the number of genus embeddings of complete bipartite graphs ⋮ Minimum genus embeddings of the complete graph ⋮ Genus embeddings of a type of graph ⋮ Upper embeddability, edge independence number and girth
Cites Work
- Unnamed Item
- Unnamed Item
- Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s+3}\)
- An infinite set of torus triangulations of connectivity 5 whose graphs are not uniquely embeddable in the torus
- A sequence representation for maps
- How to determine the maximum genus of a graph
- Face 2-colourable triangular embeddings of complete graphs
- Three nonisomorphic triangulations of an orientable surface with the same complete graph
- Exponential families of non-isomorphic triangulations of complete graphs
- Uniqueness and faithfulness of embedding of toroidal graphs
- On the number of nonisomorphic orientable regular embeddings of complete graphs
- Exponential families of non-isomorphic non-triangular orientable genus embeddings of complete graphs.
- A new characterization of the maximum genus of a graph
