Abstract
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?
BibTeX - Entry
@InProceedings{bonamy:LIPIcs.MFCS.2023.1,
author = {Bonamy, Marthe},
title = {{Exploring the Space of Colourings with Kempe Changes}},
booktitle = {48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)},
pages = {1:1--1:2},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-292-1},
ISSN = {1868-8969},
year = {2023},
volume = {272},
editor = {Leroux, J\'{e}r\^{o}me and Lombardy, Sylvain and Peleg, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2023/18535},
URN = {urn:nbn:de:0030-drops-185350},
doi = {10.4230/LIPIcs.MFCS.2023.1},
annote = {Keywords: Graph theory, graph coloring, reconfiguration}
}
|
Keywords: |
|
Graph theory, graph coloring, reconfiguration |
|
Collection: |
|
48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023) |
|
Issue Date: |
|
2023 |
|
Date of publication: |
|
21.08.2023 |
Creative Commons Attribution 4.0 International license (CC BY 4.0)