We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.

Durham e-Theses
You are in:

# Graph Algorithms and Complexity Aspects on Special Graph Classes

STEWART, ANTHONY,GRAHAM (2017) Graph Algorithms and Complexity Aspects on Special Graph Classes. Doctoral thesis, Durham University.

 Preview
PDF - Accepted Version
944Kb

## Abstract

Graphs are a very flexible tool within mathematics, as such, numerous problems can be solved by formulating them as an instance of a graph. As a result, however, some of the structures found in real world problems may be lost in a more general graph. An example of this is the 4-Colouring problem which, as a graph problem, is NP-complete. However, when a map is converted into a graph, we observe that this graph has structural properties, namely being (K_5, K_)-minor-free which can be exploited and as such there exist algorithms which can find 4-colourings of maps in polynomial time.

This thesis looks at problems which are NP-complete in general and determines the complexity of the problem when various restrictions are placed on the input, both for the purpose of finding tractable solutions for inputs which have certain structures, and to increase our understanding of the point at which a problem becomes NP-complete.

This thesis looks at four problems over four chapters, the first being Parallel Knock-Out. This chapter will show that Parallel Knock-Out can be solved in O(n+m) time on P_4-free graphs, also known as cographs, however, remains hard on split graphs, a subclass of P_5-free graphs. From this a dichotomy is shown on -free graphs for any fixed integer .

The second chapter looks at Minimal Disconnected Cut. Along with some smaller results, the main result in this chapter is another dichotomy theorem which states that Minimal Disconnected Cut is polynomial time solvable for 3-connected planar graphs but NP-hard for 2-connected planar graphs.

The third chapter looks at Square Root. Whilst a number of results were found, the work in this thesis focuses on the Square Root problem when restricted to some classes of graphs with low clique number.

The final chapter looks at Surjective H-Colouring. This chapter shows that Surjective H-Colouring is NP-complete, for any fixed, non-loop connected graph H with two reflexive vertices and for any fixed graph H’ which can be obtained from H by replacing vertices with true twins. This result enabled us to determine the complexity of Surjective H-Colouring on all fixed graphs H of size at most 4.

Item Type: Thesis (Doctoral) Doctor of Philosophy Graph Algorithms; Discrete Applied Maths; Discrete Applied Mathematics; Complexity Theory; Graph Theory; Theoretical Computer Science; Homomorphisms; H-Colouring; Square Root; Disconnected Cut; Parallel Knock Out Faculty of Science > Engineering and Computing Science, School of (2008-2017) 2017 Copyright of this thesis is held by the author 25 May 2017 10:12

Social bookmarking: