Hamilton Cycles - Ore's and Dirac's Theorem

Loading...
来自 Shanghai Jiao Tong University 的课程
Discrete Mathematics
64 个评分
Shanghai Jiao Tong University
64 个评分
从本节课中
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

探索我们的目录

免费加入并获得个性化推荐、更新和优惠。