Euler's theorem about Eulerian cycles in graphs

Episode 35.

Euler's theorem about Eulerian cycles in graphs.

Definition. An Eulerian cycle in a graph is a closed walk that passes through all edges of the graph exactly once.
Euler's theorem. A connected graph has an Eulerian cycle if and only if all of its vertices have even degrees.

Graph theory.
#GraphTheory

The same video on YouTube:
https://youtu.be/RwLdG5PFxNs

The same video on Telegram:
https://t.me/mathematical_bunker/59