List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Finding paths between 3-colourings | 2011-12-19 | Paper |
| Finding paths between 3-colorings Journal of Graph Theory | 2011-05-11 | Paper |
| Mixing 3-colourings in bipartite graphs European Journal of Combinatorics | 2009-11-30 | Paper |
| Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances Theoretical Computer Science | 2009-11-06 | Paper |
| Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
| Mixing 3-Colourings in Bipartite Graphs Graph-Theoretic Concepts in Computer Science | 2008-07-01 | Paper |
| Finding Paths between Graph Colourings: Computational Complexity and Possible Distances Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
| Connectedness of the graph of vertex-colourings Discrete Mathematics | 2008-02-14 | Paper |
Research outcomes over time
This page was built for person: Luis Cereceda
