-list-coloring toroidal -regular triangulations in linear time
arXiv:2106.01634 · doi:10.1016/j.dam.2026.01.032
Abstract
We give an explicit procedure for -list-coloring a large class of toroidal -regular triangulations in linear time. We also show that these graphs are not -choosable.
43 pages, 17 figures; an extended abstract of this work was published in Lecture Notes in Computer Science, vol. 13947, Springer, Cham (2023), pp. 134-146, doi:10.1007/978-3-031-25211-2_10