Eulerian Cycles

Del curso dictado por Shanghai Jiao Tong University
Discrete Mathematics
59 calificaciones
Shanghai Jiao Tong University
59 calificaciones
De la lección
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.

Conoce a los instructores

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

Explora nuestro catálogo

Inscríbete de manera gratuita y obtén recomendaciones personalizadas, actualizaciones y ofertas.