Eulerian Cycles

video-placeholder
Loading...
Visualizar o programa do curso

Avaliações

3.4 (138 classificações)

  • 5 stars
    43,47%
  • 4 stars
    12,31%
  • 3 stars
    7,24%
  • 2 stars
    11,59%
  • 1 star
    25,36%

NP

22 de Out de 2017

Filled StarFilled StarFilled StarFilled StarFilled Star

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

AG

4 de Dez de 2018

Filled StarFilled StarFilled StarFilled StarFilled Star

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

Na lição

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.

Ministrado por

  • Placeholder

    Dominik Scheder

    Assistant Professor

Explore nosso catálogo

Registre-se gratuitamente e obtenha recomendações, atualizações e ofertas personalizadas.