Abstract

Graph theory has experienced a fast development over the last few decades and the main reason is that many problems arising from different contexts can be treated and formulated in terms of graph theory. Indeed, all the topics in this course are motivated by practical interpretations, and they will be considered both from a theoretical and an algorithmic point of view. Topics: Eulerian graphs, Matchings, Trees (Minimum Spanning Tree Problem), Hamiltonian graphs (Travelling Salesman Problem), Vertex-Colorings. No graph theory prerequisites are required.