Eulerian Cycles

Video placeholder
Loading...
View Syllabus

Reviews

3.2 (172 ratings)

  • 5 stars
    41.27%
  • 4 stars
    10.46%
  • 3 stars
    6.97%
  • 2 stars
    11.04%
  • 1 star
    30.23%

AG

Dec 4, 2018

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

MY

Aug 8, 2017

Short course!! I use it to review my discrete math knowledge.

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.