Sylabus
The syllabus varies from year to year and is given at the beginning of the semester. Topics usually include perfect graphs and related classes, as well as polynomial-time algorithms (especially those solving the recognition, optimal coloring, maximum clique, and maximum stable set problems) for those classes.
Syllabus for Winter 2019/2020: https://iuuk.mff.cuni.cz/~ipenev/NDMI105Winter2019.html
Anotace
This course covers topics in structural graph theory and algorithms. The syllabus varies from year to year, but the focus is on decomposition and structure theorems for hereditary graph classes, and on algorithmic applications of such theorems.