Eulerian Cycles

Loading...
来自 上海交通大学 的课程
Discrete Mathematics
52 评分
上海交通大学
52 评分
从本节课中
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