Minimum genus embeddings of the complete graph

DOI10.1007/S10114-016-5425-3MaRDI QIDQ335320zbMATH OpenOpenAlexFDO

Authors Han Ren, ZhaoXiang 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

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

Recommendations

• Exponentially many genus embeddings of the complete graph \(K_{12s+3}\)
• Maximum genus and minimum genus embedding in non-orientable surfaces
• Maximum genus embeddings and genus embeddings on orientable surfaces
• On the number of genus embeddings of complete bipartite graphs
• Exponentially many maximum genus embeddings and genus embeddings for complete graphs

Cites work

• scientific article; zbMATH DE number 3754724 (Why is no real title available?)
• scientific article; zbMATH DE number 951476 (Why is no real title available?)
• scientific article; zbMATH DE number 3450230 (Why is no real title available?)
• A note on the number of graceful labellings of paths
• An infinite set of torus triangulations of connectivity 5 whose graphs are not uniquely embeddable in the torus
• Exponential families of non-isomorphic non-triangular orientable genus embeddings of complete graphs.
• Exponential families of non-isomorphic triangulations of complete graphs
• Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs
• Exponentially many maximum genus embeddings and genus embeddings for complete graphs
• Face 2-colourable triangular embeddings of complete graphs
• How to determine the maximum genus of a graph
• On the number of nonisomorphic orientable regular embeddings of complete graphs
• The maximum genus of graphs of diameter two
• Three nonisomorphic triangulations of an orientable surface with the same complete graph
• Triangular embeddings of complete graphs from graceful labellings of paths

Cited in

(19)

• Simultaneous current graph constructions for minimum triangulations and complete graph embeddings
• Maximum genus and minimum genus embedding in non-orientable surfaces
• Jungerman ladders and index 2 constructions for genus embeddings of dense regular graphs
• Maximum genus embeddings and genus embeddings on orientable surfaces
• Embeddings of circular ladder-like graph families
• Genus embeddings of a type of graph
• scientific article; zbMATH DE number 5823703 (Why is no real title available?)
• scientific article; zbMATH DE number 4150183 (Why is no real title available?)
• scientific article; zbMATH DE number 6873977 (Why is no real title available?)
• Graph minors. XIV: Extending an embedding
• scientific article; zbMATH DE number 5584120 (Why is no real title available?)
• Constructing all minimum genus embeddings of
• New methods for finding minimum genus embeddings of graphs on orientable and non-orientable surfaces
• Embedding and genus of intuitionistic fuzzy graphs on spheres
• The genus of complete 3-uniform hypergraphs
• Constructing a minimum genus embedding of the complete tripartite graph \(K_{n, n, 1}\) for odd \(n\)
• scientific article; zbMATH DE number 913548 (Why is no real title available?)
• Exponentially many genus embeddings of the complete graph \(K_{12s+3}\)
• Face distributions of embeddings of complete graphs

This page was built for publication: Minimum genus embeddings of the complete graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q335320)