Eulerian Cycles

Loading...
Visualiser le programme de cours

Avis

3.6 (107 évaluations)
  • 5 stars
    49%
  • 4 stars
    12%
  • 3 stars
    7%
  • 2 stars
    10%
  • 1 star
    21%
AG

Dec 05, 2018

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

MY

Aug 09, 2017

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

À partir de la leçon
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.

Enseigné par

  • Dominik Scheder

    Dominik Scheder

    Assistant Professor

Explorer notre catalogue

Rejoignez-nous gratuitement et obtenez des recommendations, des mises à jour et des offres personnalisées.