| Code |
Course Name |
Language |
Type |
| MAT 485E |
Graph Theory |
English |
Elective |
| Local Credits |
ECTS |
Theoretical |
Tutorial |
Laboratory |
| 3 |
6 |
3 |
0 |
0 |
| Course Prerequisites and Class Restriction |
| Prerequisites |
MUH 211 MIN DD
or MUH 211E MIN DD
or BLG 112 MIN DD
or BLG 112E MIN DD
or MAT 148 MIN DD
or MAT 148E MIN DD
|
| Class Restriction |
None |
| Course Description |
| Graphs and directed graphs, paths, cycles, trails, degrees and counting. Trees and their basic properties. Spanning trees and
enumeration. Matchings and covers, matchings in general graphs. Cuts and paths: Connectivity, cuts and connectivity, k-
connected graphs, network flow. Coloring: Vertex coloring and upper bounds, structure of k-chromatic graphs. Selected
algorithms and applications. |
|
