Exponential families of non-isomorphic non-triangular orientable genus embeddings of complete graphs.

From MaRDI portal
Publication:1850631

DOI10.1006/jctb.2002.2122zbMath1034.05017OpenAlexW2086359905MaRDI QIDQ1850631

Vladimir P. Korzhik, Heinz-Juergen Voss

Publication date: 10 December 2002

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.2002.2122




Related Items (19)

On the number of triangular embeddings of complete graphs and complete tripartite graphsOn the number of genus embeddings of complete bipartite graphsMinimum genus embeddings of the complete graphDihedral biembeddings and triangulations by complete and complete tripartite graphsExponential families of nonisomorphic nonorientable genus embeddings of complete graphsFace distributions of embeddings of complete graphsTotal embedding distributions of Ringel laddersAnother proof of the map color theorem for nonorientable surfaces.A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphsA simple construction of exponentially many nonisomorphic orientable triangular embeddings of K_12sExponentially many nonisomorphic orientable triangular embeddings of \(K_{12s}\)A new approach to constructing exponentially many nonisomorphic nonorientable triangular embeddings of complete graphsA lower bound for the number of orientable triangular embeddings of some complete graphsExponentially many nonisomorphic genus embeddings of \(K_{n,m}\)Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s+3}\)Simultaneous current graph constructions for minimum triangulations and complete graph embeddingsExponentially many maximum genus embeddings and genus embeddings for complete graphsBiembeddings of 2-rotational Steiner triple systemsExponentially many genus embeddings of the complete graph \(K_{12s+3}\)



Cites Work


This page was built for publication: Exponential families of non-isomorphic non-triangular orientable genus embeddings of complete graphs.