Finding paths between 3-colourings

MaRDI QIDQ3104271zbMATH OpenFDO

Authors Luis Cereceda, Jan van den Heuvel, Matthew Johnson

Publication date 19 December 2011

zbMATH Keywords

recolouring verticestransform colourings

Mathematics Subject Classification ID

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

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

Cited in

(15)

• Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances
• Mixing 3-colourings in bipartite graphs
• Recoloring graphs of treewidth 2
• Finding shortest paths between graph colourings
• Finding paths between 3-colorings
• Finding shortest paths between graph colourings
• Reconfiguration of List Edge-Colorings in a Graph
• Finding Paths between Graph Colourings: Computational Complexity and Possible Distances
• Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances
• Complexity of independent set reconfigurability problems
• scientific article; zbMATH DE number 1390132 (Why is no real title available?)
• Orientations and 3-colourings of graphs.
• Recoloring some hereditary graph classes
• Recoloring via modular decomposition
• Reconfiguration of list edge-colorings in a graph

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)