Eulerian Cycles

video-placeholder
Loading...
View Syllabus

Reviews

3.4 (130 ratings)
  • 5 stars
    43.84%
  • 4 stars
    12.30%
  • 3 stars
    7.69%
  • 2 stars
    12.30%
  • 1 star
    23.84%
NP
Oct 22, 2017

Fantastic course. Fascinating material, presented at a reasonably fast pace, and some really challenging assignments.

AG
Dec 4, 2018

This course is good to comprehend relation, function and combinations.

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.

Taught By

  • Placeholder

    Dominik Scheder

    Assistant Professor

Explore our Catalog

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