Eulerian Digraphs and Oriented Trees

Part of the Undergraduate Texts in Mathematics book series (UTM)


A famous problem which goes back to Euler asks for what graphs G is there a closed walk which uses every edge exactly once. (There is also a version for non-closed walks.) Such a walk is called an Eulerian tour (also known as an Eulerian cycle). A graph which has an Eulerian tour is called an Eulerian graph. Euler’s famous theorem (the first real theorem of graph theory) states that a graph G without isolated vertices (which clearly would be irrelevant) is Eulerian if and only if it is connected and every vertex has even degree. Here we will be concerned with the analogous theorem for directed graphs. We want to know not just whether an Eulerian tour exists, but also how many there are. We will prove an elegant determinantal formula for this number closely related to the Matrix-Tree Theorem. For the case of undirected graphs no analogous formula is known, explaining why we consider only the directed case.


Eulerian Digraphs Oriented Tree Euler Tour Matrix Tree Theorem Eulerian Cycle 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 8.
    H. Bidkhori, S. Kishore, Counting the spanning trees of a directed line graph. Preprint [arXiv:0910.3442]Google Scholar
  2. 24.
    N.G. de Bruijn, A combinatorial problem. Proc. Koninklijke Nederlandse Akademie v. Wetenschappen 49, 758–764 (1946); Indagationes Math. 8, 461–467 (1946)Google Scholar
  3. 26.
    N.G. de Bruijn, Acknowledgement of priority to C. Flye Sainte-Marie on the counting of circular arrangements of 2n zeros and ones that show each n-letter word exactly once, Technische Hogeschool Eindhoven, T.H.-Report 75-WSK-06, 1975Google Scholar
  4. 29.
    P. Diaconis, R.L. Graham, Magical Mathematics (Princeton University Press, Princeton, 2012)zbMATHGoogle Scholar
  5. 35.
    C. Flye Sainte-Marie, Solution to question nr. 48. l’Intermédiaire des Mathématiciens 1, 107–110 (1894)Google Scholar
  6. 45.
    I.J. Good, Normally recurring decimals. J. Lond. Math. Soc. 21, 167–169 (1947)MathSciNetGoogle Scholar
  7. 99.
    C.A.B. Smith, W.T. Tutte, On unicursal paths in a network of degree 4. Am. Math. Mon. 48, 233–237 (1941)MathSciNetCrossRefGoogle Scholar
  8. 109.
    B. Stevens, G. Hurlbert, B. Jackson (eds.), Special issue on “Generalizations of de Bruijn cycles and Gray codes”. Discrete Math. 309 (2009)Google Scholar
  9. 116.
    W.T. Tutte, The dissection of equilateral triangles into equilateral triangles. Proc. Camb. Philos. Soc. 44, 463–482 (1948)MathSciNetzbMATHCrossRefGoogle Scholar
  10. 119.
    T. van Aardenne-Ehrenfest, N.G. de Bruijn, Circuits and trees in oriented linear graphs. Simon Stevin (Bull. Belgian Math. Soc.) 28, 203–217 (1951)zbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  1. 1.Department of MathematicsMassachusetts Institute of TechnologyCambridgeUSA

Personalised recommendations