2024-03-28T12:28:10Z
https://meral.edu.mm/oai
oai:meral.edu.mm:recid/2548
2021-12-13T07:27:31Z
1582963390870:1582967739683
user-uy
Applications of Eulerian Path and Tour
Sandar Myint
Win Win Mar
Yi Myint
A path in a graph is an Eulerian path if every edge of the graph appears as an edge in the path exactly once. A closed Eulerian path is an Eulerian tour. A graph is said to be an Eulerian graph if it has an Eulerian tour. In this paper, we give necessary and sufficient conditions for a graph to be Eulerian graph and present some examples for applications of Eulerian path and tour.
2008
http://hdl.handle.net/20.500.12678/0000002548
https://meral.edu.mm/records/2548