Buekenhout, F. (Ed.). Handbook of Incidence Geometry: Building and Foundations. Amsterdam, Netherlands: North-Holland, 1995.Colbourn, C. J. and Dinitz, J. H. (Eds.). CRC Handbook of Combinatorial Designs. Boca Raton, FL: CRC Press, 1996.Mallows, C. L. and Sloane, N. J. A. "Two-Graphs, Switching Classes, and Euler Graphs are Equal in Number." SIAM J. Appl. Math.28, 876-880, 1975.Robinson, R. W. "Enumeration of Euler Graphs." In Proof Techniques in Graph Theory (Ed. F. Harary). New York: Academic Press, pp. 147-153, 1969.Seshu, S. and Reed, M. B. Linear Graphs and Electrical Networks. Reading, MA: Addison-Wesley, 1961.Sloane, N. J. A. Sequences A002854/M0846 and A189771 in "The On-Line Encyclopedia of Integer Sequences."
, 2, ... 的欧拉图的数量为 1, 1, 2, 3, 7, 16, 54, 243, 243, 2038, ... (OEIS A002854; Robinson 1969; Mallows and Sloane 1975; Buekenhout 1995, p. 881; Colbourn and Dinitz 1996, p. 687)，如上所示为前几个。存在一个给出这些数字的显式公式。
, 2, ... 的是欧拉图但不是欧拉图 (Eulerian Graph) 的图的数量为 0, 0, 0, 0, 0, 1, 2, 7, 20, 76, 334, 2498, ... (OEIS A189771)，如上所示为前几个。