- Supervisor
-
Carol Zamfirescu
- Ghent University
- Date and time
-
Monday, February 1, 2021
- (recorded lectures)
- Contact person
-
- Publication date
-
March 10, 2021
- Department
-
Computer Science
Summary
Topics presented in the course include Euler’s polyhedral formula, Kuratowski’s Theorem, the Four Colour Theorem, and the planarity test by Demoucron, Malgrange and Pertuiset.
Moreover, hamiltonian cycles and other important spanning substructures -- such as spanning trees -- will be discussed.
Topics include Grinberg’s hamiltonicity criterion for planar graphs, several heuristics for finding hamiltonian cycles including
Christofides’ algorithm, and Tutte’s Theorem
