Answers are grounded in this paper and cite their sources.
Theoretical analysis establishes upper bounds on weak degeneracy in K3,3-minor-free and K5-minor-free graphs, highlighting direct constraints on coloring parameters like DP-chromatic numbers.
Bernshteyn and Lee introduced the notion of weak degeneracy. It has been shown that increasing the weak degeneracy by one provides an upper bound for various graph coloring parameters, including DP-chromatic number and Alon-Tarsi number. In this paper, we prove that for any graph [Formula: see text] that is either [Formula: see text]-minor-free or [Formula: see text]-minor-free, we have [Formula: see text].
No takes yet. Share an insight, caveat, or question.
Chen et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: