1. R. C. Read, “Euler graphs on labelled nodes,” Canad. J. Math. 14, 482–486 (1962).
2. S. Tazawa, Y.-L. Jin and T. Shirakura, “Enumeration of labelled 2-connected Euler graphs,” J. Combin. Inform. System Sci. 23(1–4), 407–414 (1998).
3. F. Harary, Graph Theory (Addison-Wesley, Reading, MA, 1969; Mir, Moscow, 1973).
4. G. W. Ford and G. E. Uhlenbeck, “Combinatorial problems in the theory of graphs. IV,” Proc. Nat. Acad. Sci. U. S. A. 43, 163–167 (1957).
5. V. E. Stepanov, “On some features of the structure of a random graph near a critical point,” Teor. Veroyatnost. Primenen. 32(4), 633–657 (1987) [Theory Probab. Appl. 32 (4), 573–594 (1987)].