L2

Graph theory has become fundamental in computer science as it provides numerous techniques and algorithms for solving complex problems represented by graphs. In this module, we present step by step this mathematical theory, giving priority to both modeling the solution of certain problems using graphs and providing a set of techniques for students to solve these problems through algorithms. The goal is not, of course, to turn students in this option into specialists in graph theory, but to demonstrate how the judicious use of graph properties can make certain concrete problems accessible to mathematical reasoning. We propose exercises adapted to each chapter and detailed corrections for some of them. This course is intended for second-year students in the Computer Science program. The course covers the official program prescribed in the latest CANVAS for the academic year 2018 - 2019. Basic knowledge of Mathematics and algorithmic are prerequisites to make the most out of this work. The weekly workload required to master the content is 1.5 hours for lectures and 1.5 hours for tutorials. Two types of assessment are considered: continuous evaluation and a final exam. The graph theory module has a coefficient of 2 and 4 credits.