By a regular embedding of a graph into a closed surface we mean a 2-cell embedding with the automorphism group acting regularly on flags. Recently, Kwon and Nedela [Non-existence of nonorientable regular embeddings of n-dimensional cubes, Discrete Math., to appear] showed that no regular embeddings of the n-dimensional cubes Q, into nonorientable surfaces exist for any positive integer n > 2. In 1997, Nedela and Skoviera [Regular maps from voltage assignments and exponent groups, European J. Combin. 18 (1997) 807-823] presented a construction giving for each solution of the congrumce e(2) equivalent to 1 (mod n) a regular embedding M-e of the hypercube Q(n) into an orientable surface. It was conjectured that all regular embeddings of Q(n) i...
AbstractA 2-cell embedding of a graph in an orientable closed surface is called regular if its autom...
AbstractThis paper addresses the question of determining, for a given graphG, all regular maps havin...
A map on an orientable surface S is an embedding M: G → S of a connected graph G in S such that its ...
AbstractBy a regular embedding of a graph into a closed surface we mean a 2-cell embedding with the ...
AbstractBy a regular embedding of a graph K into a surface we mean a two-cell embedding of K into a ...
In this paper we give a classification of the orientable regular embeddings of Q (n) for n = 2m with...
AbstractBy a regular embedding of a graph K into a surface we mean a two-cell embedding of K into a ...
AbstractA 2-cell embedding of a graph G into a closed (orientable or nonorientable) surface is calle...
AbstractBy a regular embedding of a graph K in a surface we mean a 2-cell embedding of K in a compac...
A map is called regular if its automorphism group acts regularly on the set of all flags (incident v...
AbstractBy a regular embedding of a graph K in a surface we mean a 2-cell embedding of K in a compac...
AbstractIn the paper is developed a common generalization of two methods of construction of regular ...
AbstractWe show that if n=pe where p is an odd prime and e≥1, then the complete bipartite graph Kn,n...
AbstractA map is called regular if its automorphism group acts regularly on the set of all flags (in...
AbstractA 2-cell embedding of a graph G into a closed (orientable or nonorientable) surface is calle...
AbstractA 2-cell embedding of a graph in an orientable closed surface is called regular if its autom...
AbstractThis paper addresses the question of determining, for a given graphG, all regular maps havin...
A map on an orientable surface S is an embedding M: G → S of a connected graph G in S such that its ...
AbstractBy a regular embedding of a graph into a closed surface we mean a 2-cell embedding with the ...
AbstractBy a regular embedding of a graph K into a surface we mean a two-cell embedding of K into a ...
In this paper we give a classification of the orientable regular embeddings of Q (n) for n = 2m with...
AbstractBy a regular embedding of a graph K into a surface we mean a two-cell embedding of K into a ...
AbstractA 2-cell embedding of a graph G into a closed (orientable or nonorientable) surface is calle...
AbstractBy a regular embedding of a graph K in a surface we mean a 2-cell embedding of K in a compac...
A map is called regular if its automorphism group acts regularly on the set of all flags (incident v...
AbstractBy a regular embedding of a graph K in a surface we mean a 2-cell embedding of K in a compac...
AbstractIn the paper is developed a common generalization of two methods of construction of regular ...
AbstractWe show that if n=pe where p is an odd prime and e≥1, then the complete bipartite graph Kn,n...
AbstractA map is called regular if its automorphism group acts regularly on the set of all flags (in...
AbstractA 2-cell embedding of a graph G into a closed (orientable or nonorientable) surface is calle...
AbstractA 2-cell embedding of a graph in an orientable closed surface is called regular if its autom...
AbstractThis paper addresses the question of determining, for a given graphG, all regular maps havin...
A map on an orientable surface S is an embedding M: G → S of a connected graph G in S such that its ...