FI:MA010 Graph Theory - Course Information
MA010 Graph Theory
Faculty of InformaticsAutumn 2002
- Extent and Intensity
- 2/0. 2 credit(s) (plus extra credits for completion). Type of Completion: zk (examination).
- Teacher(s)
- doc. RNDr. Josef Niederle, CSc. (lecturer)
- Guaranteed by
- doc. RNDr. Josef Niederle, CSc.
Faculty of Informatics - Timetable
- Thu 10:00–11:50 D2
- Prerequisites (in Czech)
- ! M010 Combinatorics and Graph Theory
- Course Enrolment Limitations
- The course is also offered to the students of the fields other than those the course is directly associated with.
- fields of study / plans the course is directly associated with
- there are 6 fields of study the course is directly associated with, display
- Course objectives
- This is an introductory course in graph theory. Basic concepts and their properties as well as the formulation of simple graph problems and standard effective algorithms for solving them are presented.
- Syllabus
- Basic concepts
- Paths
- Eulerian and Hamiltonian graphs
- Trees
- Spanning trees
- The shortest-path problem
- Network flow
- Bipartite graphs and matchings
- Connectivity in graphs
- Planar graphs.
- Literature
- KUČERA, Luděk. Kombinatorické algoritmy. 2., nezměn. vyd. Praha: SNTL - Nakladatelství technické literatury, 1989, 286 s. info
- NEŠETŘIL, Jaroslav. Teorie grafů. Vyd. 1. Praha: SNTL - Nakladatelství technické literatury, 1979, 316 s. URL info
- PLESNÍK, Ján. Grafové algoritmy. 1. vyd. Bratislava: Veda, 1983, 343 s. info
- FUCHS, Eduard. Kombinatorika a teorie grafů. Vyd. 1. Praha: Státní pedagogické nakladatelství, 1986, 138 s. info
- NEŠETŘIL, Jaroslav. Kombinatorika. Vyd. 1. Praha: Státní pedagogické nakladatelství, 1983, 173 s. URL info
- Assessment methods (in Czech)
- Zkouška je písemná.
- Language of instruction
- Czech
- Follow-Up Courses
- Further comments (probably available only in Czech)
- The course is taught annually.
- Listed among pre-requisites of other courses
- Enrolment Statistics (Autumn 2002, recent)
- Permalink: https://is.muni.cz/course/fi/autumn2002/MA010