$5$-list-coloring toroidal $6$-regular triangulations in linear time
Combinatorics
2026-02-10 v3
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.
Cite
@article{arxiv.2106.01634,
title = {$5$-list-coloring toroidal $6$-regular triangulations in linear time},
author = {Niranjan Balachandran and Brahadeesh Sankarnarayanan},
journal= {arXiv preprint arXiv:2106.01634},
year = {2026}
}
Comments
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