A lower bound for the number of orientable triangular embeddings of some complete graphs
type: Item
instance of: scholarly article
title: A lower bound for the number of orientable triangular embeddings of some complete graphs
zbMATH Open document ID: 1222.05106
author: Martin Knor
author: Michael John Grannell
published in: Journal of Combinatorial Theory. Series B
publication date: 2010-04-21T00:00:00Z
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 5696990
zbMATH Keywords: Steiner triple system
zbMATH Keywords: Latin square
zbMATH Keywords: complete graph
zbMATH Keywords: triangular embedding
MaRDI profile type: Publication
full work available at URL: j.jctb.2009.08.001
OpenAlex ID: W2078554428
cites work: Q4680152
cites work: Exponential families of non-isomorphic triangulations of complete graphs
cites work: Q3745851
cites work: Triangular embeddings of complete graphs (neighborly maps) with 12 and 13 vertices
cites work: A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs
cites work: BIEMBEDDINGS OF LATIN SQUARES AND HAMILTONIAN DECOMPOSITIONS
cites work: On biembeddings of Latin squares
cites work: Q5503363
cites work: Recursive constructions for triangulations
cites work: Q3757929
cites work: A constraint on the biembedding of Latin squares
cites work: Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s}\)
cites work: On the number of nonisomorphic orientable regular embeddings of complete graphs
cites work: Exponential families of non-isomorphic non-triangular orientable genus embeddings of complete graphs.
cites work: Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs
cites work: Q4773723
DOI: 10.1016/J.JCTB.2009.08.001
Recommended article: A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs
Recommended article: On the number of triangular embeddings of complete graphs and complete tripartite graphs
Recommended article: Q3385082
Recommended article: On the number of nonisomorphic orientable regular embeddings of complete graphs
Recommended article: Lower bounds on the number of triangles in a graph
Recommended article: A simple construction for orientable triangular embeddings of the complete graphs on \(12 s\) vertices
Recommended article: Nonorientable triangular embeddings of complete graphs with arbitrarily large looseness
Recommended article: On the orientable regular embeddings of complete multipartite graphs
Recommended article: A new approach to constructing exponentially many nonisomorphic nonorientable triangular embeddings of complete graphs
Recommended article: Q3581673
description: scientific article; zbMATH DE number 5696990