Eulerian cycle
cycle in a finite graph which visits every edge exactly once
Press Enter · cited answer in seconds
0 sources
Summary
Eulerian cycle has Wikipedia articles in 18 language editions, a strong signal of global cultural recognition.[1]
Key Facts
- Eulerian cycle's video is recorded as Đường đi Euler2.gif[2].
- Eulerian cycle's image is recorded as Hexagram without lifting pen.svg[3].
- Leonhard Euler is named after Eulerian cycle[4].
- Eulerian cycle's subclass of is recorded as cycle[5].
- Eulerian cycle's subclass of is recorded as Eulerian path[6].
- Eulerian cycle's part of is recorded as Eulerian graph[7].
- Eulerian cycle's Encyclopædia Britannica Online ID is recorded as science/Eulerian-cycle[8].
- Eulerian cycle's Encyclopædia Britannica Online ID is recorded as science/Eulerian-circuit[9].
- Eulerian cycle's studied by is recorded as graph theory[10].
- Eulerian cycle's Google Knowledge Graph ID is recorded as /g/1222td09[11].
- Eulerian cycle's MathWorld ID is recorded as EulerianCycle[12].
- Eulerian cycle's Dictionary of Algorithms and Data Structures ID is recorded as eulercycle[13].
- Eulerian cycle's Dictionary of Algorithms and Data Structures ID is recorded as EulerTour[14].
- Eulerian cycle's maintained by WikiProject is recorded as WikiProject Mathematics[15].
- Eulerian cycle's PlanetMath ID is recorded as EulerCircuit[16].
Why It Matters
Eulerian cycle has Wikipedia articles in 18 language editions, a strong signal of global cultural recognition.[1] It is known by 18 alternative names across languages and contexts.[17]