L. Beineke/R. Wilson (ed.): Selected topics in graph theory II.
Academic Press 1983.

P. Catlin: A reduction method to find spanning eulerian subgraphs.
J. Graph Theory 12 (1988), 29-44.

P. Catlin: Spanning eulerian subgraphs and matchings.
Discrete Math. 76 (1989), 95-116.

P. Catlin: Supereulerian graphs. A survey.
J. Graph Theory 16 (1992), 177-196.

Z. Chen: Spanning closed trails in graphs.
Discrete Math. 117 (1993), 57-71.

H. Fleischner: Eulerian graphs. In Beineke/Wilson 1983, 17-53.

H. Fleischner: Some blood, sweat, but no tears in eulerian graph theory.
Congr. Numer. 63 (1988), 8-48.

H. Fleischner: Eulerian graphs and related topics. Part 1, volume 1.
North-Holland 1990, 400p. 0-444-88395-9. Dfl 185.

H. Fleischner: Eulerian graphs and related topics. Part 1, volume 2.
North-Holland 1991.

H. Fleischner: Spanning eulerian subgraphs, the splitting lemma,
and Petersen's theorem. Discrete Math. 101 (1992), 33-37.

C. Hierholzer: U''ber die Mo''glichkeit, einen Linienzug ohne
Wiederholung und ohne Unterbrechung zu umfahren.
Math. Ann. 6 (1873), 30-32.

L. Lesniak/O. Oellermann: An eulerian exposition.
J. Graph Theory 10 (1986), 277-297.

R. Wilson: An Eulerian trail through Ko''nigsberg.
J. Graph Th. 10 (1986), 265-275.