Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2401.03011 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913187667902464 |
|---|---|
| author | Bousquet, Nicolas |
| author_facet | Bousquet, Nicolas |
| contents | We say that a graph is $k$-mixing if it is possible to transform any $k$-coloring into any other via a sequence of single vertex recolorings keeping a proper coloring all along. Cereceda, van den Heuvel and Johnson proved that deciding if a graph is $3$-mixing is co-NP-complete and left open the case $k \ge 4$. We prove that for every $k \ge 4$, $k$-mixing is co-NP-hard. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_03011 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A Note on the Complexity of Graph Recoloring Bousquet, Nicolas Combinatorics Discrete Mathematics We say that a graph is $k$-mixing if it is possible to transform any $k$-coloring into any other via a sequence of single vertex recolorings keeping a proper coloring all along. Cereceda, van den Heuvel and Johnson proved that deciding if a graph is $3$-mixing is co-NP-complete and left open the case $k \ge 4$. We prove that for every $k \ge 4$, $k$-mixing is co-NP-hard. |
| title | A Note on the Complexity of Graph Recoloring |
| topic | Combinatorics Discrete Mathematics |
| url | https://arxiv.org/abs/2401.03011 |