Algorithms for solving graph-theoretic problems for special inputs, that is, exploit the structure of some special graph class in order to find an efficient algorithm for some graph-theoretic problem (in particular coloring, square root, surjective homomorphism) or else to show that the problem stays computationally hard even for the special graph class.

## Contact

Email: a.g.stewart@durham.ac.uk

Website: http://community.dur.ac.uk/a.g.stewart/#home