Exponentially many genus embeddings of the complete graph \(K_{12s+3}\)

DOI10.1007/s10255-015-0471-7zbMath1321.05064OpenAlexW581026782MaRDI QIDQ2355353

Han Ren, Zhao-xiang Li

Publication date: 22 July 2015

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-015-0471-7

zbMATH Keywords

complete graphcurrent graphmaximum genus embeddinggenus embedding

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (2)

On the asymptotic growth of bipartite graceful permutations ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs
• On the number of maximum genus embeddings of almost all graphs
• 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
• 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 note on the number of graceful labellings of paths
• The maximum genus of graphs of diameter two
• Triangular embeddings of complete graphs from graceful labellings of paths

This page was built for publication: Exponentially many genus embeddings of the complete graph \(K_{12s+3}\)