We prove that, for a certain positive constant a and for an infinite set of values of n, the number of nonisomorphic face 2-colourable triangular embeddings of the complete graph Kn in an orientable surface is at least nan2
AbstractOrientable triangular embeddings of the complete tripartite graph Kn,n,n correspond to biemb...
AbstractA lower bound for the number of maximum genus orientable embeddings of almost all graphs is ...
A known construction for face 2-colourable triangular embeddings of complete regular tripartite grap...
AbstractWe prove that, for a certain positive constant a and for an infinite set of values of n, the...
AbstractWe prove that, for a certain positive constant a and for an infinite set of values of n, the...
AbstractA face 2-colourable triangulation of an orientable surface by a complete graphKnexists if an...
We prove that for every prime number $p$ and odd $m>1$, as $s\to\infty$, there are at least $w^{w^2\...
AbstractThe looseness of a triangular embedding of a complete graph in a closed surface is the minim...
AbstractWe prove that the number of non-isomorphic face 2-colourable triangulations of the complete ...
AbstractWe show that for s≥11 there are at least 22s−11 nonisomorphic orientable triangular embeddin...
We construct biembeddings of some Latin squares which are Cayley tables of dihedral groups. These fa...
AbstractThis paper is concerned with nonisomorphic triangular embeddings of a complete graph into th...
AbstractThe problem of construction of a nonorientable triangular embedding of the graph Kn − K2, n ...
We prove that the number of non-isomorphic face 2-colourable triangulations of the complete graph $K...
Orientable triangular embeddings of the complete tripartite graph Kn,n,n correspond to biembeddings ...
AbstractOrientable triangular embeddings of the complete tripartite graph Kn,n,n correspond to biemb...
AbstractA lower bound for the number of maximum genus orientable embeddings of almost all graphs is ...
A known construction for face 2-colourable triangular embeddings of complete regular tripartite grap...
AbstractWe prove that, for a certain positive constant a and for an infinite set of values of n, the...
AbstractWe prove that, for a certain positive constant a and for an infinite set of values of n, the...
AbstractA face 2-colourable triangulation of an orientable surface by a complete graphKnexists if an...
We prove that for every prime number $p$ and odd $m>1$, as $s\to\infty$, there are at least $w^{w^2\...
AbstractThe looseness of a triangular embedding of a complete graph in a closed surface is the minim...
AbstractWe prove that the number of non-isomorphic face 2-colourable triangulations of the complete ...
AbstractWe show that for s≥11 there are at least 22s−11 nonisomorphic orientable triangular embeddin...
We construct biembeddings of some Latin squares which are Cayley tables of dihedral groups. These fa...
AbstractThis paper is concerned with nonisomorphic triangular embeddings of a complete graph into th...
AbstractThe problem of construction of a nonorientable triangular embedding of the graph Kn − K2, n ...
We prove that the number of non-isomorphic face 2-colourable triangulations of the complete graph $K...
Orientable triangular embeddings of the complete tripartite graph Kn,n,n correspond to biembeddings ...
AbstractOrientable triangular embeddings of the complete tripartite graph Kn,n,n correspond to biemb...
AbstractA lower bound for the number of maximum genus orientable embeddings of almost all graphs is ...
A known construction for face 2-colourable triangular embeddings of complete regular tripartite grap...
DOI
Add to ORKG