6 search results - page 1 / 2 » Two-connected orientations of Eulerian graphs |
APPROX
2008
Springer
13 years 6 months ago
2008
Springer
We consider testing directed graphs for being Eulerian in the orientation model introduced in [15]. Despite the local nature of the property of being Eulerian, it turns out to be ...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
JGT
2006
13 years 4 months ago
2006
WG
2004
Springer
13 years 10 months ago
2004
Springer
It has long been known that the number of spanning trees in circulant graphs with fixed jumps and n nodes satisfies a recurrence relation in n. The proof of this fact was algebra...
COMBINATORICS
2004
13 years 4 months ago
2004
The set of all orientations of a planar graph with prescribed outdegrees carries the structure of a distributive lattice. This general theorem is proven in the first part of the p...