Logo ČVUT
CZECH TECHNICAL UNIVERSITY IN PRAGUE
STUDY PLANS
2024/2025

Graph Theory

The course is not on the list Without time-table
Code Completion Credits Range Language
01TG ZK 5 4P+0C Czech
Vztahy:
In order to register for the course 01PTG, the student must have successfully completed the course 01TG.
Garant předmětu:
Lecturer:
Tutor:
Supervisor:
Department of Mathematics
Synopsis:

1. Basic notion of graph theory.

2. Edge and vertex connectivity (Menger Theorem).

3. Bipartite graphs.

4. Trees and forests.

5. Spanning trees (Matrix-Tree Theorem).

6. Euler tours and Hamilton cycles.

7. Maximal and perfect matching.

8. Edge coloring.

9. Flows in networks.

10. Vertex coloring.

11. Plannar graphs (Kuratowski theorem), vertex coloring of planar graphs.

12. Spectrum of the adjacency matrix.

13. Extremal graph theory.

Requirements:
Syllabus of lectures:
Syllabus of tutorials:
Study Objective:
Study materials:

Key references:

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

[2] M. Rigo: Advanced Graph Theory and Combinatorics, Wiley-ISTE 2016.

Optional references:

[3] A. Bondy, U.S.R. Murty: Graph Theory, Springer-Verlag London 2008.

Note:
Further information:
No time-table has been prepared for this course
The course is a part of the following study plans:
Data valid to 2024-05-28
Aktualizace výše uvedených informací naleznete na adrese https://bilakniha.cvut.cz/en/predmet6361606.html