Hamilton Cycles - Ore's and Dirac's Theorem

Loading...
上海交通大学
3.5(96 个评分) | 24K 名学生已注册
查看授课大纲

审阅

3.5(96 个评分)
  • 5 stars
    45 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

探索我们的目录

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