$5$-list-coloring toroidal $6$-regular triangulations in linear time
Niranjan Balachandran, Brahadeesh Sankarnarayanan·2021-06-03·via math.CO updates on arXiv.org
We give an explicit procedure for $5$-list-coloring a large class of toroidal $6$-regular triangulations in linear time. We also show that these graphs are not $3$-choosable.