An algorithm for an Eulerian trail traversing specified edges in given order

DOI10.1016/0166-218X(94)90010-8zbMath0811.05042OpenAlexW2085206979MaRDI QIDQ1343142

Mao-cheng Cai

Publication date: 1 February 1995

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(94)90010-8

zbMATH Keywords

algorithmEulerian graphedge-connectivityEulerian trail

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

The algorithms for the Eulerian cycle and Eulerian trail problems for a multiple graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some remarks on Arc‐connectivity, vertex splitting, and orientation in graphs and digraphs
• On some connectivity properties of Eulerian graphs
• A Reduction Method for Edge-Connectivity in Graphs
• An eulerian trail traversing specified edges in given order

This page was built for publication: An algorithm for an Eulerian trail traversing specified edges in given order