WEEK 13

EULER PATHS AND CIRCUITS

CS-6105 Discrete Mathematics

WEEK 13 : EULER PATHS AND CIRCUITS
Module Learning Outcomes:

By the end of this module, a student is able to:

1. Define Euler paths and identify its components.
2. Identify the Hamilton paths and cycles.
Topics Covered

• Euler Paths
- Euler Paths and Circuits
EULER PATHS AND
- Components of Euler Paths
CIRCUITS
• Hamilton Paths
EULER PATHS and CIRCUITS
EULER PATHS and CIRCUITS

More precisely, a walk in a graph is a sequence of vertices such that every vertex in
the sequence is adjacent to the vertices before and after it in the sequence. If the
walk travels along every edge exactly once, then the walk is called an Euler path (or
Euler walk). If, in addition, the starting and ending vertices are the same (so you trace
along every edge exactly once and end up where you started), then the walk is called
an Euler circuit (or Euler tour). Of course if a graph is not connected, there is no hope
of finding such a path or circuit.
EULER PATHS and CIRCUITS
EULER PATHS and CIRCUITS
HAMILTON PATHS
HAMILTON PATHS
HAMILTON PATHS
HAMILTON PATHS
END