Weak degeneracy of graphs
Anton Bernshteyn, Eugene Lee

TL;DR
This paper introduces the concept of weak degeneracy in graphs, explores its properties, and demonstrates its implications for graph coloring, including bounds for planar graphs and a version of Brooks's theorem.
Contribution
The paper defines weak degeneracy, relates it to existing graph parameters, and proves new bounds and properties, including a generalized Brooks's theorem and results for graphs with specific girth and chromatic number.
Findings
Planar graphs are weakly 4-degenerate.
A version of Brooks's theorem for weak degeneracy is established.
Graphs with girth at least 5 or bounded chromatic number are weakly (d - Omega(sqrt(d)))-degenerate.
Abstract
Motivated by the study of greedy algorithms for graph coloring, we introduce a new graph parameter, which we call weak degeneracy. By definition, every -degenerate graph is also weakly -degenerate. On the other hand, if is weakly -degenerate, then (and, moreover, the same bound holds for the list-chromatic and even the DP-chromatic number of ). It turns out that several upper bounds in graph coloring theory can be phrased in terms of weak degeneracy. For example, we show that planar graphs are weakly -degenerate, which implies Thomassen's famous theorem that planar graphs are -list-colorable. We also prove a version of Brooks's theorem for weak degeneracy: a connected graph of maximum degree is weakly -degenerate unless . (By contrast, all -regular graphs have degeneracy .) We actually prove an…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
