Finding paths between 3-colourings

zbMATH Open1235.05135MaRDI QIDQ3104271FDOQ3104271

Authors: Luis Cereceda, Jan van den Heuvel, Matthew Johnson 

Publication date: 19 December 2011

Recommendations

• Finding paths between 3-colorings
• Finding Paths between Graph Colourings: Computational Complexity and Possible Distances
• Finding shortest paths between graph colourings
• Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances
• Finding shortest paths between graph colourings

zbMATH Keywords

recolouring verticestransform colourings

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Cited In (12)

• Reconfiguration of List Edge-Colorings in a Graph
• Finding Paths between Graph Colourings: Computational Complexity and Possible Distances
• Orientations and 3-colourings of graphs.
• Title not available (Why is that?)
• Finding shortest paths between graph colourings
• Finding shortest paths between graph colourings
• Complexity of independent set reconfigurability problems
• Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances
• Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances
• Recoloring some hereditary graph classes
• Reconfiguration of list edge-colorings in a graph
• Finding paths between 3-colorings

This page was built for publication: Finding paths between 3-colourings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3104271)