Eulerian is an adjective relating to or denoting a path or circuit in mathematics that uses every edge of a graph exactly once. It also pertains to Euler, a mathematician, or to concepts named after him. In practice, it often describes networks, routes, or properties associated with Eulerian paths or cycles in graph theory.
Full pronunciation guide
