Preprint
Sep 2026
Color Complexity of Recolorable Graph Exploration: Upper and Lower Bounds via Block Structure
The optimal number of colors on two classes defined by block structure is determined and the first nontrivial color lower bounds for unrestricted recoloring are proved, which improves the previous five-color upper bound to a tight four.
Shoma Hiraoka, Shun Imori, Shota Takahashi et al.
· 0 citations