Description

In this project, we are going to explore how we can use graph algorithms in order to prove or disprove a conjectured result, or how we can improve existing results in graph theory with the help of computer search. One of the possible directions is related to the toughness of graphs and its relation to the existence of Hamilton cycles, but other directions can be chosen in accordance with the interests of the student and the current status of the literature.