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, ian@cs.bris.ac.uk. Last modified on Wednesday 4 February 1998 at 09:07. © 1998 University of Bristol