| Article ID: | iaor2002904 |
| Country: | Spain |
| Volume: | 6 |
| Issue: | 1 |
| Start Page Number: | 123 |
| End Page Number: | 138 |
| Publication Date: | Jan 1998 |
| Journal: | TOP |
| Authors: | Lpez Enrique Benavent, Fernndez David Soler |
Given a connected graph G, we present a polynomial algorithm which either finds a tour traversing each edge of G exactly two non-consecutive times, one in each direction, or decides that no such tour exists. The main idea of this algorithm is based on the modification of a proof given by Thomassen related to a problem proposed by Ore in 1951.