On a conjecture of Mohar concerning Kempe equivalence of regular graphs
- Submitting institution
-
University of Durham
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 117329
- Type
- D - Journal article
- DOI
-
10.1016/j.jctb.2018.08.002
- Title of journal
- Journal of Combinatorial Theory, Series B
- Article number
- -
- First page
- 179
- Volume
- 135
- Issue
- -
- ISSN
- 00958956
- Open access status
- Compliant
- Month of publication
- -
- Year of publication
- 2018
- URL
-
https://doi.org/10.1016/j.jctb.2018.08.002
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
3
- Research group(s)
-
B - Algorithms and Complexity
- Citation count
- 3
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- The paper completely settles a conjecture for which only a single special case had previously been tackled. As well as state-of-the-art graph theory, the paper makes it possible to determine the validity of the Wang-Swendsen-Kotecky algorithm for the antiferromagnetic Potts model at zero-temperature. The paper took the study of reconfigurations of graph colourings in a new direction by making the link to Kempe changes which has stimulated interest. See for example, Diameter of Colorings Under Kempe Changes (COCOON 2019).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -