Euler tours
Description: Closed walks in a graph that traverse every edge exactly once, studied in graph theory and combinatorial algorithms.
Primary topic: Complexity and Algorithms in Graphs (23%)
Wikidata ID: wiki/Q11691793
OpenAlex ID: keywords/euler-tours
