Elementary Introduction to Graph Theory

Garant předmětu:

Lecturer:

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:

Further information:

No time-table has been prepared for this course

The course is a part of the following study plans:

• Aplikovaná informatika (compulsory course in the program)