Elementary Introduction to Graph Theory

Course guarantor:

Edita Pelantová

Lecturer:

Petr Ambrož, Zuzana Masáková

Tutor:

Supervisor:

Department of Mathematics

Synopsis:

The course provides an explanation of basics of graph theory, followed by a survey of common graph algorithms.

Requirements:

Syllabus of lectures:

1. Basic and enumerative combinatorics.

2. The Notion of a graph.

3. Trees and spanning trees.

4. Eulerian trails and Hamiltonian cycles.

5. Flows in networks.

6. Coloring and matching.

7. Planar graphs.

Syllabus of tutorials:

Study Objective:

Study materials:

Povinná literatura:

[1] J.A. Bondy, U.S.R. Murty: Graph theory. Springer, New York, 2008.

[2] W. Kocay, D. L. Kreher: Graphs, Algorithms, and Optimization (2nd ed.). Chapman and Hall/CRC, 2016.

[3] R. Diestel: Graph Theory (5th ed.), Springer-Verlag Berlin Heidelberg, 2017.

Note:

Time-table for winter semester 2024/2025:

	06:00–08:0008:00–10:0010:00–12:0012:00–14:0014:00–16:0016:00–18:0018:00–20:0020:00–22:0022:00–24:00
Mon
Tue
Wed
Thu
Fri	roomTR:212 Ambrož P. 10:00–11:50 (lecture parallel1) Trojanova 13

Time-table for summer semester 2024/2025:

Time-table is not available yet

The course is a part of the following study plans:

• Aplikovaná informatika (compulsory course in the program)