pith. sign in

arxiv: 1612.08698 · v2 · pith:UAU23FHMnew · submitted 2016-12-27 · 🧮 math.CO

List coloring with requests

classification 🧮 math.CO
keywords listarisingassignmentcolorcoloringcontextdirectionsexplore
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.