Eulerian Cycles

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

Рецензии

3.5 (оценок: 98)
  • 5 stars
    47 ratings
  • 4 stars
    13 ratings
  • 3 stars
    5 ratings
  • 2 stars
    11 ratings
  • 1 star
    22 ratings
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.

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

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

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