Luis Cereceda

According to our database, Luis Cereceda authored at least 7 papers between 2006 and 2011.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2011

Finding paths between 3-colorings.

Luis Cereceda, Jan van den Heuvel, Matthew Johnson

J. Graph Theory, 2011

2009

Finding Paths between graph colourings: PSPACE-completeness and superpolynomial distances.

Paul S. Bonsma, Luis Cereceda

Theor. Comput. Sci., 2009

Mixing 3-colourings in bipartite graphs.

Luis Cereceda, Jan van den Heuvel, Matthew Johnson

Eur. J. Comb., 2009

2008

Connectedness of the graph of vertex-colourings.

Luis Cereceda, Jan van den Heuvel, Matthew Johnson

Discret. Math., 2008

Finding Paths Between 3-Colourings.

Matthew Johnson, Luis Cereceda, Jan van den Heuvel

Proceedings of the 19th International Workshop on Combinatorial Algorithms, 2008

2007

Finding Paths between Graph Colourings: Computational Complexity and Possible Distances.

Paul S. Bonsma, Luis Cereceda, Jan van den Heuvel, Matthew Johnson

Electron. Notes Discret. Math., 2007

2006

Finding Paths between Colourings.

Luis Cereceda

Proceedings of the Algorithms and Complexity in Durham 2006, 2006