Luis Cereceda

	2011
9		Luis Cereceda, Jan van den Heuvel, Matthew Johnson: Finding paths between 3-colorings. Journal of Graph Theory 67(1): 69-82 (2011)
	2009
8		Luis Cereceda, Jan van den Heuvel, Matthew Johnson: Mixing 3-colourings in bipartite graphs. Eur. J. Comb. 30(7): 1593-1606 (2009)
7		Paul S. Bonsma, Luis Cereceda: Finding Paths between graph colourings: PSPACE-completeness and superpolynomial distances. Theor. Comput. Sci. 410(50): 5215-5226 (2009)
	2008
6		Matthew Johnson, Luis Cereceda, Jan van den Heuvel: Finding Paths Between 3-Colourings. IWOCA 2008: 182-196
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 Bonsma (Paul S. Bonsma)	[2] [4] [7]
2	Jan van den Heuvel	[2] [3] [5] [6] [8] [9]
3	Matt Johnson (Matthew Johnson)	[2] [3] [5] [6] [8] [9]

Last update Tue May 29 01:28:40 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page