The following pages link to (Q3424786):
Displaying 22 items.
- Classifying coloring graphs (Q284746) (← links)
- The \(a\)-graph coloring problem (Q516830) (← links)
- On a conjecture of Mohar concerning Kempe equivalence of regular graphs (Q1719578) (← links)
- Reconfiguring graph homomorphisms on the sphere (Q1987080) (← links)
- In most 6-regular toroidal graphs all 5-colorings are Kempe equivalent (Q2143401) (← links)
- Switching 3-edge-colorings of cubic graphs (Q2144509) (← links)
- Introduction to reconfiguration (Q2331456) (← links)
- Counting edge-Kempe-equivalence classes for 3-edge-colored cubic graphs (Q2449143) (← links)
- Connectedness of the graph of vertex-colourings (Q2470462) (← links)
- Reflexive coloring complexes for 3-edge-colorings of cubic graphs (Q2659215) (← links)
- Hamiltonian cycles and 1-factors in 5-regular graphs (Q2668019) (← links)
- On Vizing's edge colouring question (Q2680572) (← links)
- Reconfiguration graphs of zero forcing sets (Q2686137) (← links)
- The three-state Potts antiferromagnet on plane quadrangulations (Q4689521) (← links)
- Ergodicity of the Wang–Swendsen–Kotecký algorithm on several classes of lattices on the torus (Q5875873) (← links)
- Kempe equivalence of colourings of cubic graphs (Q5890904) (← links)
- Diameter of colorings under Kempe changes (Q5918932) (← links)
- Kempe equivalence of colourings of cubic graphs (Q5965525) (← links)
- Kempe equivalence of 4‐critical planar graphs (Q6047640) (← links)
- Kempe equivalent list edge-colorings of planar graphs (Q6091809) (← links)
- On a recolouring version of Hadwiger's conjecture (Q6144404) (← links)
- Strengthening a Theorem of Meyniel (Q6158364) (← links)
