Minimum genus embeddings of the complete graph

DOI10.1007/s10114-016-5425-3zbMath1348.05061OpenAlexW2519890139MaRDI QIDQ335320

Han Ren, Zhao-xiang Li

Publication date: 2 November 2016

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

Full work available at URL: https://doi.org/10.1007/s10114-016-5425-3

zbMATH Keywords

complete graphcurrent graphmaximum genus embeddingminimum genus embedding

Mathematics Subject Classification ID

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

Related Items

Unnamed Item, Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs
• Exponentially many maximum genus embeddings and genus embeddings for complete graphs
• An infinite set of torus triangulations of connectivity 5 whose graphs are not uniquely embeddable in the torus
• 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