List coloring with requests

DOI10.1002/jgt.22447zbMath1429.05064arXiv1612.08698OpenAlexW2910866842WikidataQ128583516 ScholiaQ128583516MaRDI QIDQ5207462

Luke Postle, Zdeněk Dvořák, Serguei Norine

Publication date: 30 December 2019

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1612.08698

zbMATH Keywords

constraint satisfactionlist coloringcombinatorial Nullstellensatz

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (8)

Reconfiguring 10-colourings of planar graphs ⋮ Flexible list colorings in graphs with special degeneracy conditions ⋮ Flexibility of triangle‐free planar graphs ⋮ 4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz ⋮ Flexibility of planar graphs -- sharpening the tools to get lists of size four ⋮ Flexible List Colorings in Graphs with Special Degeneracy Conditions ⋮ On weak flexibility in planar graphs ⋮ On sufficient conditions for planar graphs to be 5-flexible

This page was built for publication: List coloring with requests