Eulerian Cycles

Loading...
Просмотреть программу курса

Рецензии

3.5 (оценок: 118)
  • 5 stars
    46.61%
  • 4 stars
    11.86%
  • 3 stars
    6.77%
  • 2 stars
    11.86%
  • 1 star
    22.88%
NP

Oct 23, 2017

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

AG

Dec 05, 2018

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

Из урока
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.

Преподаватели

  • Dominik Scheder

    Dominik Scheder

    Assistant Professor

Ознакомьтесь с нашим каталогом

Присоединяйтесь бесплатно и получайте персонализированные рекомендации, обновления и предложения.