We consider a notion of embedding digraphs on orientable surfaces, applicable to digraphs in which the indegree equals the outdegree for every vertex, i.e., Eulerian digraphs. This idea has been considered before in the context of "compatible Euler tours" or "orthogonal A-trails" by Andsersen at al [1] and by Bouchet [4]. This prior work has mostly been limited to embeddings of Eulerian digraphs on predetermined surfaces, and to digraphs with underlying graphs of maximum degree at most 4. In this paper, a foundation is laid for the study of all Eulerian digraph embeddings. Results are proved which are analogous to those fundamental to the theory of undirected graph embeddings, such as Duke's Theorem [5], and an infinite family of digraphs which demonstrates that the genus range for an embeddable digraph can be any nonnegative integer is given. We show that it is possible to have genus range equal to one, with arbitrarily large minimum genus, unlike in the undirected case. The difference between the minimum genera of a digraph and its underlying graph is considered, as is the difference between the maximum genera. We say that a digraph is upper-embeddable if it can be embedded with 2 or 3 regions, and prove that every regular tournament is upper-embeddable. |

__Keywords__

digraphs, coloring, embedding

__Math Review Classification__

Primary 005

__Last Updated__

December 1998

__Length__

16 pages

__Availability__

This article is available in: