Hamilton Cycles - Ore's and Dirac's Theorem

Loading...
查看授課大綱

審閱

3.5(112 個評分)
  • 5 stars
    46%
  • 4 stars
    13%
  • 3 stars
    7%
  • 2 stars
    13%
  • 1 star
    21%
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

探索我們的目錄

免費加入並獲得個性化推薦、更新和優惠。