5-List Coloring Toroidal 6-Regular Triangulations in Linear Time
N Balachandran, B Sankarnarayanan - Conference on Algorithms and …, 2023 - Springer
Conference on Algorithms and Discrete Applied Mathematics, 2023•Springer
… 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. … The main
result of this paper, Theorem 1, is a linear time algorithm for \(5\)-list coloring a large class of
these toroidal \(6\)-regular triangulations. Our result is nearly tight for this class in the sense
that the list size is at most one more than the choice number for any graph in this family. In
fact, in Corollary 1 we find an infinite family of \(5\)-chromatic-choosable graphs for which a list …
triangulations in linear time. We also show that these graphs are not 3-choosable. … The main
result of this paper, Theorem 1, is a linear time algorithm for \(5\)-list coloring a large class of
these toroidal \(6\)-regular triangulations. Our result is nearly tight for this class in the sense
that the list size is at most one more than the choice number for any graph in this family. In
fact, in Corollary 1 we find an infinite family of \(5\)-chromatic-choosable graphs for which a list …
Abstract
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.
Springer
Showing the best result for this search. See all results