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

Authors:
Vladimir P. Korzhik;Heinz-Jurgen Voss
Affiliations:
Bogomoltsa St. 3/5, Chernovtsy, 58001, Ukraine;Technische Universitat Dresden, Fachrichtung Mathematik, Mommsenstr. 13, D-01062 Dresden, Germany
Venue:
Journal of Combinatorial Theory Series B
Year:
2002

Citing 5
Cited 5

Topological graph theory

Topological graph theory
Three nonisomorphic triangulations of an orientable surface with the same complete graph

Discrete Mathematics
Face 2-colourable triangular embeddings of 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

Another proof of the map color theorem for nonorientable surfaces

Journal of Combinatorial Theory Series B
Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs

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 for every i ∈ {1,2,..., 11}\{3,4,7} the complete graph K12s+i for s ≥ d(i) ∈ {1,2, 3, 4} has at least h(i)4s non-isomorphic orientable genus embeddings, where h(i) ∈ {1,½,1/4,1/8}.