Exploring the Space of Colourings with Kempe Changes (Invited Talk)

Author Marthe Bonamy

Thumbnail PDF


  • Filesize: 391 kB
  • 2 pages

Document Identifiers

Author Details

Marthe Bonamy
  • CNRS, LaBRI, Université de Bordeaux, France

Cite AsGet BibTex

Marthe Bonamy. Exploring the Space of Colourings with Kempe Changes (Invited Talk). In 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 272, pp. 1:1-1:2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)


Kempe changes were introduced in 1879 in an attempt to prove the 4-colour theorem. They are a convenient if not crucial tool to prove various colouring theorems. Here, we consider how to navigate from a colouring to another through Kempe changes. When is it possible? How fast?

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Graph coloring
  • Graph theory
  • graph coloring
  • reconfiguration


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Kenneth Appel and Wolfgang Haken. The solution of the four-color-map problem. Scientific American, 237(4):108-121, 1977. Google Scholar
  2. Armen S. Asratian and Carl Johan Casselgren. Solution of Vizing’s problem on interchanges for the case of graphs with maximum degree 4 and related results. Journal of Graph Theory, 82(4):350-373, 2016. Google Scholar
  3. Marthe Bonamy, Oscar Defrain, Tereza Klimošová, Aurélie Lagoutte, and Jonathan Narboni. On vizing’s edge colouring question. Journal of Combinatorial Theory, Series B, 159:126-139, 2023. Google Scholar
  4. Alfred B. Kempe. On the geographical problem of the four colours. American journal of mathematics, 2(3):193-200, 1879. Google Scholar
  5. Jessica McDonald, Bojan Mohar, and Diego Scheide. Kempe equivalence of edge-colorings in subcubic and subquartic graphs. Journal of Graph theory, 70(2):226-239, 2012. Google Scholar
  6. Jonathan Narboni. Vizing’s edge-recoloring conjecture holds. arXiv preprint arXiv:2302.12914, 2023. Google Scholar
  7. Vadim G. Vizing. On an estimate of the chromatic class of a p-graph. Discret Analiz, 3:25-30, 1964. Google Scholar
  8. Vadim G. Vizing. Some unsolved problems in graph theory. Russian Mathematical Surveys, 23(6):125, 1968. Google Scholar
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail