![](https://www.pdfsearch.io/img/6c39100a8976fc89ad0e1a34755c4193.jpg) Date: 2017-04-12 10:30:42
| | Finding Paths between Graph Colourings: PSPACE-completeness and Superpolynomial Distances Paul Bonsma∗ Institut f¨ ur Mathematik, Sekr. MA 6-1, Technische Universit¨at Berlin,Add to Reading ListSource URL: www.cdam.lse.ac.ukDownload Document from Source Website File Size: 213,27 KBShare Document on Facebook
|