Abstract

We characterize those finite connected graphs which admit a closed walk such that each edge is traversed once in each direction and such that no edge is succeeded by the same edge in the opposite direction. This solves an old problem of O. Ore.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.