The course is open to all interested students of Neapolis University Pafos and is conducted in English.
The course will not appear on the diploma/transcript but will count as an additional course from JetBrains.
In addition to theoretical lectures, a few practical sessions will be held. Attendance is crucial. The grade is based on attendance and exam results.

The course is dedicated to advanced graph theory and those sections of it that I particularly enjoy.
It is largely based on the book Graph Theory by D.V. Karpov and his course of the same name.

Exam Questions.

Google Sheet for attendance and homeworks.

The final score for the course is calculated by the formula: 0.4 * attendance + 0.6 * exam.

Lectures

1. (10.10.2024) Paths and Cycles.
2. (17.10.2024) Matchings.
3. (24.10.2024) Introduction to Connectivity.
4. (31.10.2024) k-Connected Graphs.
5. (07.11.2024) Connectivity.
6. (14.11.2024) Practice Session.
7. (21.11.2024) Inseparable Graphs.
8. (28.11.2024) Spanning Trees.
9. (05.12.2024) Coloring.
10. (11.12.2024) Planar Graphs.
11. (19.12.2024) Planar Graphs+.
12. (13.01.2025) Constructible Graphs, Hypergraph Coloring.

Homeworks

1. Cycles and Matchings.
2. Common Problems.
3. Basics of Connectivity.
4. Connectivity.
5. Colorings.
6. Colorings+.
7. Planar Graphs.