Flexible list colorings: maximizing the number of requests satisfied
type: Item
instance of: scholarly article
title: Flexible list colorings: maximizing the number of requests satisfied
zbMATH Open document ID: 1542.05056
author: Hemanshu Kaul
author: Rogers Mathew
author: J. A. Mudrock
author: Michael J. Pelsmajer
published in: Journal of Graph Theory
publication date: 2024-07-02T00:00:00Z
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 7874806
zbMATH Keywords: flexible list coloring
zbMATH Keywords: Hall ratio
zbMATH Keywords: list coloring
zbMATH Keywords: list coloring with requests
zbMATH Keywords: list packing
MaRDI profile type: MaRDI publication profile
cites work: Q4500691
cites work: Colorings and orientations of graphs
cites work: Q4862104
cites work: Counterexamples to a Conjecture of Harris on Hall Ratio
cites work: List coloring of Cartesian products of graphs
cites work: Flexible list colorings in graphs with special degeneracy conditions
cites work: Packing list‐colorings
cites work: Flexibility of planar graphs -- sharpening the tools to get lists of size four
cites work: Flexibility of planar graphs of girth at least six
cites work: Flexibility of triangle‐free planar graphs
cites work: 1-subdivisions, the fractional chromatic number and the Hall ratio
cites work: List coloring with requests
cites work: Q3922703
cites work: Q3356317
cites work: Criticality, the list color function, and list coloring the Cartesian product of graphs
cites work: On the Alon-Tarsi number and chromatic-choosability of Cartesian products of graphs
cites work: List coloring a Cartesian product with a complete bipartite factor
cites work: DP‐coloring Cartesian products of graphs
cites work: Flexibility of planar graphs without 4-cycles
cites work: A short proof that the list packing number of any graph is well defined
cites work: On sufficient conditions for planar graphs to be 5-flexible
DOI: 10.1002/JGT.23103
description: scientific article; zbMATH DE number 7874806