2 papers
math.CO2024
Weak Degeneracy of Planar Graphs
Anton Bernshteyn, Eugene Lee, Evelyne Smith-Roberge
The weak degeneracy of a graph is a numerical parameter that was recently introduced by the first two authors with the aim of understanding the power of greedy algorithms for g…
math.CO2021
Weak degeneracy of graphs
Anton Bernshteyn, Eugene Lee
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…