Basic terminology: trees, bipartite graphs, graph and labyrinth search. Eulerian graphs. matchings in graphs, König's theorem, Hall theorem and its corollaries. measuring of graph connectivity. Menger's theorem, Planar graphs, Euler's theorem. Kuratowski's theorem. Graph coloring: some NP-hard problems, greedy algorithm. Brooks' theorem. Vizing's theorem. Coloring of planar graphs. Flows, Ford–Fulkerson algorithm and its applications. Integer and group flows, relationship to coloring. Hamiltonian graphs. Chvátal's theorem. Random graphs, probabilistic models, properties of random graphs.

Type of methodology: Combination of lecture and hands-on

Participants receive the certificate of attendance: Yes

Paid training activity for participants: Yes, for all

Participants prerequisite knowledge: Numerical methods (linear algebra, statistics) Domain-specific background knowledge