Jan Bok, Avinandan Das, Anna Gujgiczer, Nikola Jedlicková. Generalizing Brooks' Theorem via Partial Coloring Is Hard Classically and Locally. In Emilio Di Giacomo, Debajyoti Mondal, editors, WALCOM: Algorithms and Computation - 20th International Conference and Workshops on Algorithms and Computation, WALCOM 2026, Perugia, Italy, March 4-6, 2026, Proceedings. Volume 16444 of Lecture Notes in Computer Science, pages 247-262, Springer, 2026. [doi]
Abstract is missing.