TATA64 · 6 credits · Advanced level (A1N) · Matematik, Tillämpad matematik
Graph Theory
Active · next start VT 2027
100%
passed the latest regular sitting
UPG1 · 28 May 2026 · 14 students
100%
passed the regular sittings, all sittings over the last 5 years
UPG1 · 58 students
This module only reports passing results, so the pass rate does not show how many did not pass.
Part of 7 programmes
- Master of Science in Computer Science and Engineering
- Master of Science in Information Technology
- Master of Science in Computer Science and Software Engineering
- Master of Science in Engineering Mathematics
- Bachelor's Programme in Mathematics
- Master's Programme in Computer Science
- Master's Programme in Mathematics
Hand-in or lab
UPG1 Hand-in assignment
- 5
- 4
- 3
Main rounds
100% passed · 58 students
- 100%14
- 100%10
- 100%22
- 100%12
Later rounds
No sittings with at least 5 students.
- Get 4 or 5: 38% (58 students)
Show small sittings (1)
Sittings with fewer than 5 students, often credit transfers or special sittings. They are not part of any figure on this page.
- 100%1
About the course
Aim
The course aims to provide a thorough understanding of graph theoretical concepts and the ability to use them in mathematics, natural sciences, and computer science. After completing the course, the student should
- be familiar with important classes of graph theoretical problems,
- be able to formulate and use central theorems about trees, matchings, connectivity, colorings, as well as planar and Hamiltonian graphs,
- be able to describe and apply some basic algorithms for graphs,
- have knowledge of elementary Ramsey theory,
- be able to solve simple graph theoretical problems and use graph theory as a tool in modeling.
Content
- Trees: Cayley’s formula and spanning trees
- Connectivity and Menger’s theorem,
- Hamilton cycles and colorings of graphs,
- Matchings and coverings, Tutte’s theorem on perfect matchings, Egervary's algorithm
- Elementary Ramsey theory
- Plane graphs: Euler’s formula, the five-color theorem
- Some applications of graphs in natural science, timetabling and computer science.
- Examiner
- Carl Johan Casselgren
- Scheduled hours
- 48 h
- Main field of study
- Matematik, Tillämpad matematik