5-list-coloring toroidal 6-regular triangulations in linear time
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.