Flexible list colorings: maximizing the number of requests satisfied

DOI10.1002/JGT.23103MaRDI QIDQ6565815zbMATH OpenFDO

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

Publication date 2 July 2024

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

Full work available at URL https://doi.org/10.1002/JGT.23103

zbMATH Keywords

flexible list coloringHall ratiolist coloringlist coloring with requestslist packing

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Flexible list colorings in graphs with special degeneracy conditions
• On weak flexibility in planar graphs
• Flexibility of planar graphs -- sharpening the tools to get lists of size four
• Flexible coloring of graphs
• List coloring with requests

Cites work

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

Cited in

(4)

• Packing colourings in complete bipartite graphs and the inverse problem for correspondence packing
• Sampling list packings
• Fractional list packing for layered graphs
• Maximizing satisfied vertex requests in list coloring

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

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