arXiv Analytics

Sign in

arXiv:2106.01634 [math.CO]AbstractReferencesReviewsResources

$5$-list-coloring toroidal $6$-regular triangulations in linear time

Niranjan Balachandran, Brahadeesh Sankarnarayanan

Published 2021-06-03Version 1

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, so the choice number of each of these graphs is either $4$ or $5$.

Comments: 37 pages, 14 figures
Categories: math.CO
Subjects: 05C15, 05C85, 05C10, 05C75
Related articles: Most relevant | Search more
arXiv:2204.11100 [math.CO] (Published 2022-04-23)
Partitioning into degenerate graphs in linear time
arXiv:2207.01985 [math.CO] (Published 2022-07-05)
Many regular triangulations and many polytopes
arXiv:1701.05806 [math.CO] (Published 2017-01-20)
Generalized Petersen graphs are recognizable in linear time

Links

Toolbox