Eulerian path: Revision history

Jump to navigation Jump to search
Template:FlatlistExternal tools:

Template:Endflatlist

For any version listed below, click on its date to view it. For more help, see Help:Page history and Help:Edit summary. Template:Nowrap from current version, Template:Nowrap from preceding version, Template:Nowrap, Template:Nowrap, Template:Nowrap

12 November 2025

  • curprev 10:0910:09, 12 November 2025 ~2025-32989-60 talk 29,663 bytes +29,663 Changed definition from "An Eulerian cycle, also called an Eulerian circuit or Euler tour, in an undirected graph is a cycle that uses each edge exactly once." to "An Eulerian cycle, also called an Eulerian circuit or Euler tour, in an undirected graph is a circuit that uses each edge exactly once." As Euler tours are closed trails where vertices may be repeated as stated earlier - not cycles(closed paths where vertices must not be repeated).
Retrieved from "https://wiki.sarg.dev/index.php/Eulerian_path"