Lecture: ??? ???–??? in ???

1. : Critical graphs and algorithmic complexity of coloring graphs on surfaces.
2. : List version of Brooks' theorem and Gallai trees, Density of critical graphs.
3. : Coloring and nowhere-zero flows.
4. : Discharging method: How to find a proof?
5. : Grötzsch theorem using discharging.
6. : The proof of the Four Color Theorem.
7. : List coloring in planar graphs.
8. : Potential method: Density of 4-critical graphs and Grötzsch theorem.
9. : Coloring of triangle-free graphs and the Rosenfeld counting method.
10. : Variants of graph coloring. Acyclic and star coloring. Defective and clustered coloring. Circular coloring, fractional coloring, homomorphisms.

Lecture notes from the past years:

• Cirkulární barevnost. Orientace grafu a cirkulární barevnost.
• Barevnost a homomorfismy. Zlomková barevnost. Zlomková barevnost Mycielského grafů.
• Vybíravost.
• Entropy compression method.
• Applications of the probabilistic method in graph coloring.

Other materials:

• Presentation and notes from the presentation for the critical graphs and coloring graphs on surfaces.
• Grötzch theorem by discharging: Assignment description, the worksheet, the tex file for the worksheet.