List coloring with requests

DOI10.1002/JGT.22447MaRDI QIDQ5207462zbMATH OpenOpenAlexWikidataFDO

Authors Zdeněk Dvořák, Luke Postle, 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

combinatorial Nullstellensatzconstraint satisfactionlist coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

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.

Recommendations

• Flexibility of triangle‐free planar graphs
• Flexibility of planar graphs of girth at least six
• List-colourings
• On uniquely 3-list colorable graphs
• Graph colorings with local constraints -- a survey

Cited in

(16)

• On weak flexibility in planar graphs
• On sufficient conditions for planar graphs to be 5-flexible
• Flexibility of planar graphs -- sharpening the tools to get lists of size four
• A relation between choosability and uniquely list colorability
• Reconfiguring 10-colourings of planar graphs
• 4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz
• List-colourings
• Flexible list colorings in graphs with special degeneracy conditions
• Flexibility of triangle‐free planar graphs
• Flexible List Colorings in Graphs with Special Degeneracy Conditions
• Flexible list colorings: maximizing the number of requests satisfied
• Ramsey numbers through the lenses of polynomial ideals and Nullstellensätze
• Flexibility of planar graphs without C₄ and C₅
• On list coloring with separation of the complete graph and set system intersections
• Packing colourings in complete bipartite graphs and the inverse problem for correspondence packing
• Maximizing satisfied vertex requests in list coloring

This page was built for publication: List coloring with requests

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5207462)