AbstractDefine the directed genus, Γ(G), of an Eulerian digraph G to be the minimum value of p for which G has a 2-cell embedding in the orientable surface of genus p so that every face of the embedding is bounded by a directed circuit in G. The directed genus of the de Bruijn graph Dn is shown to be Γ(Dn)=2n−1+1−12(n+2)∑d|n+2ϕ(d)2n+2d
AbstractWe define the maximum genus, γM(G), of a connected graph G to be the largest genus γ(N) for ...
The genus g(G) of a graph G is the minimum g such that G has an embedding on the orientable surface ...
AbstractThe Euler genus of the surface Σ obtained from the sphere by the addition of k crosscaps and...
AbstractWe consider a notion of embedding digraphs on orientable surfaces, applicable to digraphs in...
The genus g(G) of a graph G is the minimum g such that G has an embedding on the orientable surface ...
A directed multigraph is called Eulerian if it has a circuit which uses each edge exactly once. Eule...
6siA directed multigraph is called Eulerian if it has a circuit which uses each edge exactly once. E...
A directed multigraph is called Eulerian if it has a circuit which uses each edge exactly once. Eule...
A directed multigraph is called Eulerian if it has a circuit which uses each edge exactly once. Eule...
AbstractThe Euler genus of the surface Σ obtained from the sphere by the addition of k crosscaps and...
AbstractA signed graph is a graph in which each edge is labelled with a sign. A cycle C of a signed ...
AbstractThe maximum genus, γM(G), of a connected graph G is the largest genus γ(S) for orientable su...
AbstractA dual-Eulerian graph is a plane graph which has an ordering defined on its edge set which f...
A drawing of a graph on a surface is independently even if every pair of nonadjacent edges in the dr...
AbstractIn earlier works, additivity theorems for the genus and Euler genus of unions of graphs at t...
AbstractWe define the maximum genus, γM(G), of a connected graph G to be the largest genus γ(N) for ...
The genus g(G) of a graph G is the minimum g such that G has an embedding on the orientable surface ...
AbstractThe Euler genus of the surface Σ obtained from the sphere by the addition of k crosscaps and...
AbstractWe consider a notion of embedding digraphs on orientable surfaces, applicable to digraphs in...
The genus g(G) of a graph G is the minimum g such that G has an embedding on the orientable surface ...
A directed multigraph is called Eulerian if it has a circuit which uses each edge exactly once. Eule...
6siA directed multigraph is called Eulerian if it has a circuit which uses each edge exactly once. E...
A directed multigraph is called Eulerian if it has a circuit which uses each edge exactly once. Eule...
A directed multigraph is called Eulerian if it has a circuit which uses each edge exactly once. Eule...
AbstractThe Euler genus of the surface Σ obtained from the sphere by the addition of k crosscaps and...
AbstractA signed graph is a graph in which each edge is labelled with a sign. A cycle C of a signed ...
AbstractThe maximum genus, γM(G), of a connected graph G is the largest genus γ(S) for orientable su...
AbstractA dual-Eulerian graph is a plane graph which has an ordering defined on its edge set which f...
A drawing of a graph on a surface is independently even if every pair of nonadjacent edges in the dr...
AbstractIn earlier works, additivity theorems for the genus and Euler genus of unions of graphs at t...
AbstractWe define the maximum genus, γM(G), of a connected graph G to be the largest genus γ(N) for ...
The genus g(G) of a graph G is the minimum g such that G has an embedding on the orientable surface ...
AbstractThe Euler genus of the surface Σ obtained from the sphere by the addition of k crosscaps and...
DOI
Add to ORKG