Subjects

Your browser does not support JavaScript, or its support is disabled. Some features may not be available.

Selected Chapters on Graph Theory - NDMI070

Title:	Vybrané kapitoly z teorie grafů
Form of teaching:	lecture
Guaranteed by:	Department of Applied Mathematics (32-KAM)
Faculty:	Faculty of Mathematics and Physics
Actual:	from 2026
Duration in semesters:	1
Semester:	both
E-Credits:	3
Hours per week, examination:	2/0, Ex [HT]
Capacity:	unlimited
Maximum number of enrolled students:	unlimited
Min. number of students:	unlimited
4EU+:	no
Virtual mobility / capacity:	no
State of the course:	taught
Language:	Czech, English
Teaching methods:	full-time
Repeated enrollment:	unlimited
Note:	you can enroll for the course in winter and in summer semester

Guarantor:	prof. RNDr. Jan Kratochvíl, CSc.
Teacher(s):	Josse van Dobben de Bruyn, Ph.D.
Class:	DS, diskrétní modely a algoritmy
Classification:	Informatics > Discrete Mathematics

Opinion survey results WS schedule Noticeboard

Annotation -

Last update: G_I (05.06.2007)

Course completion requirements -

Oral exam.

Last update: Kratochvíl Jan, prof. RNDr., CSc. (05.06.2019)

Literature - Czech

Reinhard Diestel: Graph Theory, Springer-Verlag, Heidelberg, Graduate Texts in Mathematics, Volume 173, ISBN 3-540-26183-4, 2005

Molloy, Michael; Reed, Bruce: Graph colouring and the probabilistic method. [B] Algorithms and Combinatorics. 23. Berlin: Springer. xiv, 326 p. DM, 160.39 (2002). ISBN 3-540-42139-4

casopisecka literatura

Last update: T_KAM (15.01.2007)

Course assessment methods and requirements for successful completion, grading scheme -

The exam is oral. The content of the exam will correspond to the topics studied during the course.

Last update: Kratochvíl Jan, prof. RNDr., CSc. (05.06.2019)

Syllabus -

Adevanced topics in Graph Theory. Chooseability and other generalizations of graph coloring, computational complexity of selected graph theory problems. Connections to algebraic graph theory. Further contemporary topics following the recent development of the discipline. Self reading and reporting on current research papers in the area will be an integral part of the course, as well as open problem solving.

Last update: G_I (05.06.2007)