Back to Results
First PageMeta Content



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 List

Document Date: 2017-04-12 10:30:42


Open Document

File Size: 213,27 KB

Share Result on Facebook
UPDATE