|
|
|
||
Last update: G_I (05.06.2007)
|
|
||
Last update: prof. RNDr. Jan Kratochvíl, CSc. (05.06.2019)
Oral exam. |
|
||
Last update: T_KAM (15.01.2007)
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: prof. RNDr. Jan Kratochvíl, CSc. (05.06.2019)
The exam is oral. The content of the exam will correspond to the topics studied during the course. |
|
||
Last update: G_I (05.06.2007)
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. |