Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs

Authors:
Vladimir P. Korzhik;Heinz-Jürgen Voss
Affiliations:
Bogomoltsa 3/5, Chernovtsy 58001, Ukraine;Technische Universität Dresden, Fachrichtung Mathematik, Mommsenstr. 13, D-01062 Dresden, Germany
Venue:
Journal of Combinatorial Theory Series B
Year:
2004

Citing 8
Cited 5

Topological graph theory

Topological graph theory
Tight and untight triangulations of surfaces by complete graphs

Journal of Combinatorial Theory Series B
Exponential families of non-isomorphic triangulations of complete graphs

Journal of Combinatorial Theory Series B
On the number of nonisomorphic orientable regular embeddings of complete graphs

Journal of Combinatorial Theory Series B
Nonisomorphic complete triangulations of a surface

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

Journal of Combinatorial Theory Series B
Another proof of the map color theorem for nonorientable surfaces

Journal of Combinatorial Theory Series B
Recursive constructions for triangulations

Journal of Graph Theory

On the maximal distance between triangular embeddings of a complete graph

Journal of Combinatorial Theory Series B
Triangular embeddings of complete graphs from graceful labellings of paths

Journal of Combinatorial Theory Series B
A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs

Journal of Combinatorial Theory Series B
A lower bound for the number of orientable triangular embeddings of some complete graphs

Journal of Combinatorial Theory Series B
Triangular Embeddings

Journal of Graph Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is shown that there are constants M and c such that for n ≥ M the number of nonisomorphic nonorientable genus embeddings of the complete graph Kn is at least c2n/6.