Hamilton Cycles - Ore's and Dirac's Theorem

Loading...
En provenance du cours de Shanghai Jiao Tong University
Discrete Mathematics
75 notes
Shanghai Jiao Tong University
75 notes
À partir de la leçon
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.

Rencontrer les enseignants

  • Dominik Scheder
    Dominik Scheder
    Assistant Professor
    The Department of Computer Science and Engineering

Explorer notre catalogue

Rejoignez-nous gratuitement et obtenez des recommendations, des mises à jour et des offres personnalisées.