2000 character limit reached
List coloring with requests
Published 27 Dec 2016 in math.CO | (1612.08698v2)
Abstract: Let G be a graph with a list assignment L. Suppose a preferred color is given for some of the vertices; how many of these preferences can be respected when L-coloring G? We explore several natural questions arising in this context, and propose directions for further research.
Paper Prompts
Sign up for free to create and run prompts on this paper.