Flexible list colorings: maximizing the number of requests satisfied

DOI10.1002/jgt.23103zbMath1542.05056MaRDI QIDQ6565815

Jeffrey A. Mudrock, Hemanshu Kaul, Rogers Mathew, Michael J. Pelsmajer

Publication date: 2 July 2024

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

zbMATH Keywords

list coloringHall ratiolist packingflexible list coloringlist coloring with requests

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Alon-Tarsi number and chromatic-choosability of Cartesian products of graphs
• Colorings and orientations of graphs
• Criticality, the list color function, and list coloring the Cartesian product of graphs
• On sufficient conditions for planar graphs to be 5-flexible
• Flexibility of planar graphs -- sharpening the tools to get lists of size four
• List coloring a Cartesian product with a complete bipartite factor
• List coloring of Cartesian products of graphs
• 1-subdivisions, the fractional chromatic number and the Hall ratio
• Flexibility of planar graphs of girth at least six
• Counterexamples to a Conjecture of Harris on Hall Ratio
• List coloring with requests
• Flexible list colorings in graphs with special degeneracy conditions
• Flexibility of triangle‐free planar graphs
• DP‐coloring Cartesian products of graphs
• A short proof that the list packing number of any graph is well defined
• Packing list‐colorings
• Flexibility of planar graphs without 4-cycles

This page was built for publication: Flexible list colorings: maximizing the number of requests satisfied