Course detail

Graphs and Algorithms

FSI-SGA-AAcad. year: 2025/2026

The course will provide students with basic concepts of the theory of graphs and with some algorithms based on that theory. After the basic definitions, the classic problems will be discussed including the Euler path and Hamilton cycle of a graph, vertex colouring, planar graphs etc. The next concept to be investigated will be trees and algorithms for a minimal spaning tree finding. Students will also learn about bipartite graphs, matching problem and shortest path problem. Direcdted graphs will also be discusses including algorithms for critical path finding. Finally, networks and flows in them will be deal with. The course will be oriented towards applications of graphs that can be found in many areas, particularly in technological sciences. Emphasis will be placed on applications in computer science, optimization, theory of control, and operation research.

Language of instruction

English

Number of ECTS credits

4

Mode of study

Not applicable.

Guarantor

prof. RNDr. Josef Šlapal, CSc.

Department

Institute of Mathematics (ÚM)

Entry knowledge

Students are expected to have secondary school knowledge of set theory and combinatorics.

Rules for evaluation and completion of the course

The course unit credit is awarded on condition of having attended the seminars actively and passed a written test. The exam has a written and an oral part. The written part tests student's ability to deal with various problems using the knowledge and skills acquired in the course. In the oral part, the student has ro prove that he or she has mastered the related theory.

 

The attendance at seminars is required and will be checked systematically by the teacher supervising the seminar. If a student misses a seminar, an excused absence can be cpmpensated for via make-up topics of exercises.

Aims

The course aims to acquaint the students with the theory of graphs and graph-based algorithms, which are commonly used to solve problems in engineering and many other areas.

The students will be made familiar with the basics of the theory of graphs and graph algorithms. This will provide them with tools for using graphs to model various practical problems, which may then be solved by using the graph algorithms.

Study aids

The students may use the study texts provided by the subject supervisor that are placed at the web page of the Institute of Mathematics as files for downloading. 

Prerequisites and corequisites

Not applicable.

Basic literature

Biggs, N.L.: Discrete Mathematics, Oxford Science Publications 1999 (EN)
Bondy, J.A., Murty, U.S.R.: Graph Theory, Springer 2008 (EN)
Saoub, K.R.: Graph Theory, An Introduction to Proofs, Algorithms, and Applications, Chapman and Hall/CRC 2021 (EN)
Zverovich, V.: Modern Applications of Graph Theory, OUP Oxford 2021  (EN)

Recommended reading

 Gross, J.L., Yellen, J., Anderson, M.: Graph Theory and its Applications, Chapman and Hall/CRC, 2023 (EN)
Sedláček, J.: Úvod do teorie grafů, Academia, Praha 1977 (CS)
Wallis, W.D.: A Beginner's Guide to Graph Theory, Birkhäuser Boston 2000 (EN)
Willson, J.R., Watkins, J.J.: Graphs: An Introductory Approach, Wiley 1990 (EN)

Classification of course in study plans

  • Programme N-AIM-A Master's 2 year of study, winter semester, compulsory
  • Programme N-LAN-A Master's 1 year of study, winter semester, compulsory
  • Programme N-MAI-A Master's 1 year of study, winter semester, compulsory
  • Programme N-MAI-P Master's 1 year of study, winter semester, compulsory

Type of course unit

 

Lecture

26 hod., optionally

Teacher / Lecturer

prof. RNDr. Josef Šlapal, CSc.

Syllabus

  1. Basic con cepts
  2. Walks, paths and, cycles
  3. Trees and spanning trees
  4. Vertex coloring
  5. Planarity
  6. Sorting algorithms
  7. Shortest path problem
  8. Edge colouring
  9. Bipartite graphs
  10. Sorting
  11. Directed graphs
  12. Critical path problem
  13. Flows and Networks

Exercise

13 hod., compulsory

Teacher / Lecturer

prof. RNDr. Josef Šlapal, CSc.

Syllabus

Seminars will closely follow the lectures.