Pages that link to "Item:Q1039431"

The following pages link to Mixing 3-colourings in bipartite graphs (Q1039431):

Displaying 46 items.

• Classifying coloring graphs (Q284746) (← links)
• Finding shortest paths between graph colourings (Q309791) (← links)
• Reconfiguration of dominating sets (Q346508) (← links)
• The complexity of rerouting shortest paths (Q392173) (← links)
• Complexity of independent set reconfigurability problems (Q441866) (← links)
• On the parameterized complexity of reconfiguration problems (Q527426) (← links)
• Shortest paths between shortest paths (Q719258) (← links)
• Homomorphism complexes and \(k\)-cores (Q724876) (← links)
• Fast recoloring of sparse graphs (Q896058) (← links)
• Paths between colourings of sparse graphs (Q1621073) (← links)
• Reconfiguration on nowhere dense graph classes (Q1658772) (← links)
• Reconfiguration graphs of shortest paths (Q1660288) (← links)
• Recoloring graphs via tree decompositions (Q1686264) (← links)
• On a conjecture of Mohar concerning Kempe equivalence of regular graphs (Q1719578) (← links)
• Cut-colorings in coloring graphs (Q1733874) (← links)
• A polynomial version of Cereceda's conjecture (Q2131856) (← links)
• In most 6-regular toroidal graphs all 5-colorings are Kempe equivalent (Q2143401) (← links)
• List-recoloring of sparse graphs (Q2145762) (← links)
• Recoloring graphs of treewidth 2 (Q2231701) (← links)
• Classification of reconfiguration graphs of shortest path graphs with no induced 4-cycles (Q2279287) (← links)
• Reconfiguration graph for vertex colourings of weakly chordal graphs (Q2286594) (← links)
• Using contracted solution graphs for solving reconfiguration problems (Q2329308) (← links)
• Connectivity and Hamiltonicity of canonical colouring graphs of bipartite and complete multipartite graphs (Q2331438) (← links)
• Introduction to reconfiguration (Q2331456) (← links)
• Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs (Q2436666) (← links)
• Connectedness of the graph of vertex-colourings (Q2470462) (← links)
• Homomorphism complexes, reconfiguration, and homotopy for directed graphs (Q2701005) (← links)
• Independent set reconfiguration in cographs and their generalizations (Q2825488) (← links)
• A reconfigurations analogue of Brooks' theorem and its consequences (Q2833252) (← links)
• Finding Shortest Paths Between Graph Colourings (Q2946021) (← links)
• Finding paths between 3-colorings (Q2998926) (← links)
• Shortest Paths between Shortest Paths and Independent Sets (Q3000494) (← links)
• Mixing 3-Colourings in Bipartite Graphs (Q3508565) (← links)
• (Q5026983) (← links)
• (Q5075761) (← links)
• Distributed Recoloring (Q5090902) (← links)
• Recoloring Planar Graphs of Girth at Least Five (Q5883290) (← links)
• Bipartite 3-regular counting problems with mixed signs (Q5925701) (← links)
• Characterizing circular colouring mixing for pq<4 $\frac{p}{q}\lt 4$ (Q6093150) (← links)
• Mixing is hard for triangle-free reflexive graphs (Q6146497) (← links)
• Digraph redicolouring (Q6146501) (← links)
• Homomorphism complexes, reconfiguration, and homotopy for directed graphs (Q6161696) (← links)
• 5‐Coloring reconfiguration of planar graphs with no short odd cycles (Q6199387) (← links)
• Strengthening the directed Brooks' theorem for oriented graphs and consequences on digraph redicolouring (Q6201022) (← links)
• Redicolouring digraphs: directed treewidth and cycle-degeneracy (Q6585259) (← links)
• Reconfiguration graph for vertex colourings of weakly chordal graphs (Q6621198) (← links)