An eulerian trail traversing specified edges in given order
Cai Mao‐cheng, Herbert Fleischner · Journal of Graph Theory · 1995
Abstract The following results are proved in this paper. Let G be a 2k‐edge‐connected eulerian graph. (i) For every set {e1, e2, ⃛, e2k+1} ⊆ E(G) there is an eulerian trail T of the form e1, e2, ⃛, e2k+1, ⃛. (ii) For every set E* = {e1, e2, ⃛, ek} ⊆ E(G) there is an eulerian trail T = e1, ⃛, e2, ⃛, ek, ⃛ in which the elements of E* are traversed in accordance with a prescribed orientation. © 1995 John Wiley & Sons, Inc.