Hamilton Cycles - Ore's and Dirac's Theorem

Loading...
來自 Shanghai Jiao Tong University 的課程
Discrete Mathematics
59 個評分
Shanghai Jiao Tong University
59 個評分
從本節課中
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
    The Department of Computer Science and Engineering

探索我們的目錄

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