Kempe equivalence of colourings of cubic graphs
From MaRDI portal
Publication:5965525
DOI10.1016/j.ejc.2016.06.008zbMath1348.05074OpenAlexW2963305098MaRDI QIDQ5965525
Daniël Paulusma, Matthew Johnson, Carl Feghali
Publication date: 12 October 2016
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2016.06.008
Related Items (10)
In most 6-regular toroidal graphs all 5-colorings are Kempe equivalent ⋮ Kempe equivalence of 4‐critical planar graphs ⋮ Kempe equivalent list edge-colorings of planar graphs ⋮ On a conjecture of Mohar concerning Kempe equivalence of regular graphs ⋮ Reconfiguring graph homomorphisms on the sphere ⋮ Partitioning a graph into degenerate subgraphs ⋮ Distributed Recoloring ⋮ Frozen (Δ + 1)-colourings of bounded degree graphs ⋮ Introduction to reconfiguration ⋮ Ergodicity of the Wang–Swendsen–Kotecký algorithm on several classes of lattices on the torus
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Perfectly contractile graphs
- Fast recoloring of sparse graphs
- Kempe classes and the Hadwiger conjecture
- Geometric coloring theory
- Les 5-colorations d'un graphe planaire forment une classe de commutation unique
- On a conjecture of Mohar concerning Kempe equivalence of regular graphs
- Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs
- Counting edge-Kempe-equivalence classes for 3-edge-colored cubic graphs
- Connectedness of the graph of vertex-colourings
- A Personal List of Unsolved Problems Concerning Lattice Gases and Antiferromagnetic Potts Models
- Improved bounds for sampling colorings
- A Reconfigurations Analogue of Brooks' Theorem and Its Consequences
- The complexity of change
- Kempe Equivalence of Edge-Colorings in Subcubic and Subquartic Graphs
- Finding paths between 3-colorings
This page was built for publication: Kempe equivalence of colourings of cubic graphs
