List coloring with requests
Combinatorics
2018-11-20 v2
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.
Keywords
Cite
@article{arxiv.1612.08698,
title = {List coloring with requests},
author = {Zdeněk Dvořák and Sergey Norin and Luke Postle},
journal= {arXiv preprint arXiv:1612.08698},
year = {2018}
}
Comments
19 pages, 2 figures; revision according to referee suggestions