# Eulerian Path Graph

Eulerian Path Graph

## Game description:

A game that consists of sequentially click through the network/graph nodes (you can repeat the node) so that finally all the edges have been visited without repeating any of them. This is the definition of an eulerian path or Eulerian Trail in graph theory. Think about the order in which you have to move sequentially from one node to another attached node, so that all the edges are visited because you have passed through them all.

**Temas:**Brain Games for Kids, Logic Games for Kids, Math Games for Kids