![](https://dblp.org/img/logo.320x120.png)
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
"Finding Paths between graph colourings: PSPACE-completeness and ..."
Paul S. Bonsma, Luis Cereceda (2009)
- Paul S. Bonsma, Luis Cereceda:
Finding Paths between graph colourings: PSPACE-completeness and superpolynomial distances. Theor. Comput. Sci. 410(50): 5215-5226 (2009)
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.