An eulerian trail traversing specified edges in given order

The following results are proved in this paper. Let G be a 2k-edge-connected eulerian graph. (i) For every set {e₁, e₂, ?, e_2k+1} ? E(G) there is an eulerian trail T of the form e₁, e₂, ?, e_2k+1, ?. (ii) For every set E* = {e₁, e₂, ?, e_k} ? E(G) there is an eulerian trail T = e₁, ?, e₂, ?, e_k, ? in which the elements of E* are traversed in accordance with a prescribed orientation. © 1995 John Wiley & Sons, Inc.