Proper conflict-free degree-choosability of graphs with maximum average degree less than 8/3
math.CO
Submitted: 2026-10-30
Updated: 2026-11-08
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Sources
- Degree-choosability of proper conflict-free list coloring of sparse graphs
- Proper conflict-free choosability of planar graphs
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality