Introduction to Graph Theory

About this programme

The course treats grapph theoretical notions and problems, and the use of algorithms, both in the mathematical theory of graphs and its applications. In the course, the basic theory of graphs of different kinds is developed in detail, especially trees and bipartite graphs. In the course some of the algorithms that totally or partly solve graph theoretical problems are presented. An example of such a problem is to find a matching of maximum weight, and another is to find a maximum flow in a network. The theory for matchings and Hall's theorem are treated, as well as spanning trees and Menger's theorem. Further, the theory of vertex and edge colouring, including Brooks' theorem and Vizing's theorem, are presented. Finally, an introduction to matroid theory is included. Your message goes to Infocenter, and they’ll make sure it gets to the right person – so you get the best and most relevant reply.