Flexible list colorings: maximizing the number of requests satisfied
From MaRDI portal
Publication:6565815
DOI10.1002/JGT.23103zbMATH Open1542.05056MaRDI QIDQ6565815FDOQ6565815
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)
Recommendations
Cites Work
- Title not available (Why is that?)
- Colorings and orientations of graphs
- Title not available (Why is that?)
- Flexibility of triangle‐free planar graphs
- Criticality, the list color function, and list coloring the Cartesian product of graphs
- List coloring of Cartesian products of graphs
- On the Alon-Tarsi number and chromatic-choosability of Cartesian products of graphs
- Title not available (Why is that?)
- A short proof that the list packing number of any graph is well defined
- Title not available (Why is that?)
- Counterexamples to a Conjecture of Harris on Hall Ratio
- On sufficient conditions for planar graphs to be 5-flexible
- Flexibility of planar graphs -- sharpening the tools to get lists of size four
- Flexibility of planar graphs of girth at least six
- List coloring with requests
- Flexible list colorings in graphs with special degeneracy conditions
- 1-subdivisions, the fractional chromatic number and the Hall ratio
- List coloring a Cartesian product with a complete bipartite factor
- DP‐coloring Cartesian products of graphs
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6565815)
