[ Bristol CS | Index ]
As a PhD student, I studied algorithmic graph theory, and in particular the
NP-completeness of graph theory problems. I still have an interest, though it
is not an active research area of mine any more. Here are the papers that I
published back then.
The NP-Completeness of Edge Colouring
The NP-Completeness of Some Edge-partition Problems
The Computational Complexity of Graph Theory Problems (thesis; not
available at the moment).
Dr. Ian Holyer,
firstname.lastname@example.org. Last modified on Wednesday 4 February 1998 at 09:07. © 1998 University of Bristol