Eulerian Cycles

Loading...
From the course by Shanghai Jiao Tong University
Discrete Mathematics
64 ratings
Shanghai Jiao Tong University
64 ratings
From the lesson
Eulerian and Hamiltonian Cycles
Starting with the well-known "Bridges of Königsberg" riddle, we prove the well-known characterization of Eulerian graphs. We discuss Hamiltonian paths and give sufficient criteria for their existence with Dirac's and Ore's theorem.

Meet the Instructors

  • Dominik Scheder
    Dominik Scheder
    Assistant Professor
    The Department of Computer Science and Engineering

Explore our Catalog

Join for free and get personalized recommendations, updates and offers.