List coloring with requests

Luke Postle; Sergey Norin; Zden\v{e}k Dvo\v{r}\'ak

REVIEW

List coloring with requests

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1612.08698 v2 pith:UAU23FHM submitted 2016-12-27 math.CO

Zdeněk Dvořák , Sergey Norin , Luke Postle This is my paper · ORCID

classification math.CO

keywords listarisingassignmentcolorcoloringcontextdirectionsexplore

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

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.

Discussion (0). Continue with ORCID to comment.

Pith tools