Eulerian path

(redirected from Eulerian cycle)

Eulerian path

[ȯi′ler·ē·ən ′path]
(mathematics)
A path that traverses each of the lines in a graph exactly once.
Mentioned in ?
References in periodicals archive ?
An Eulerian cycle in the graph of a pattern cyclic class can be realized by a sequence of values if and only if the order relations implied by the individual edges form a directed acyclic graph, and thus can be extended to a partial order, as then any extension to a total order will provide a realisation of a universal cycle.
We will show how to select an Eulerian cycle in G([Av.
We have only indicated the class sizes where Eulerian cycles exist.