Graph Colouring with Input Restrictions

In this thesis, we research the computational complexity of the graph colouring problem and its variants including precolouring extension and list colouring for graph classes that can be characterised by forbidding one or more induced subgraphs. We investigate the structural properties of such graph classes and prove a number of new properties. We then consider to what extent these properties can be used for efficiently solving the three types of colouring problems on these graph classes. In some cases we obtain polynomial-time algorithms, whereas other cases turn out to be NP-complete. We determine the computational complexity of k-COLOURING, k-PRECOLOURING EXTENSION and LIST k-COLOURING on -free graphs. In particular, we prove that k-COLOURING on -free graphs is NP-complete, 4-PRECOLOURING EXTENSION -free graphs is NP-complete, and LIST 4-COLOURING on -free graphs is NP-complete. In addition, we show the existence of an integer r such that k-COLOURING is NP-complete for -free graphs with girth 4. In contrast, we determine for any fixed girth a lower bound such that every -free graph with girth at least is 3-colourable. We also prove that 3-LIST COLOURING is NP-complete for complete graphs minus a matching. We present a polynomial-time algorithm for solving 4-PRECOLOURING EXTENSION on -free graphs, a polynomial-time algorithm for solving LIST 3-Colouring on -free graphs, and a polynomial-time algorithm for solving LIST 3-COLOURING on -free graphs. We prove that LIST k-COLOURING for -free graphs is also polynomial-time solvable. We obtain several new dichotomies by combining the above results with some known results.