Luis Cereceda

	2008
5		Luis Cereceda, Jan van den Heuvel, Matthew Johnson: Connectedness of the graph of vertex-colourings. Discrete Mathematics 308(5-6): 913-919 (2008)
	2007
4		Paul S. Bonsma, Luis Cereceda: Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances. MFCS 2007: 738-749
3		Luis Cereceda, Jan van den Heuvel, Matthew Johnson: Mixing 3-Colourings in Bipartite Graphs. WG 2007: 166-177
2		Paul S. Bonsma, Luis Cereceda, Jan van den Heuvel, Matthew Johnson: Finding Paths between Graph Colourings: Computational Complexity and Possible Distances. Electronic Notes in Discrete Mathematics 29: 463-469 (2007)
	2006
1		Luis Cereceda: Finding Paths between Colourings. ACiD 2006: 155

Coauthor Index

1	Paul S. Bonsma	[2] [4]
2	Jan van den Heuvel	[2] [3] [5]
3	Matt Johnson (Matthew Johnson)	[2] [3] [5]