A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Choosability in bounded sequential list coloring
[article]
2018
arXiv
pre-print
The list coloring problem is a variation of the classical vertex coloring problem, extensively studied in recent years, where each vertex has a restricted list of allowed colors, and having some variations as the (γ,μ)-coloring, where the color lists have sequential values with known lower and upper bounds. This work discusses the choosability property, that consists in determining the least number k for which it has a proper list coloring no matter how one assigns a list of k colors to each
arXiv:1812.11685v1
fatcat:c2bryajixjdjrhhgfxsfugtg4i