Eulertur

Noun

 * 1)  Eulerian trail
 * 2) * year unknown, K. Jess, J. Skott, H.C. Hansen og J. Schou, Kristine Jess, Matematik for Laererstuderende, Samfundslitteratur ISBN 9788759313367, page 355
 * 1) Hvis der findes en lukket Eulertur gennem grafen G, så har alle knudepunkter i G lige valens. 2) Hvis alle punkter i G har lige valens, så findes der en lukket  Eulertur gennem grafen.
 * 1) If there exists a closed Eulerian trail through the graph G, then all nodes in G have even degree. 2) If all nodes in G have even degree, then there exists a closed Eulerian trail through the graph.