Showing 2025Show all
2 papers · 1 filter
math.CO2025
On Wegner's 8-Coloring Theorem for Planar Graphs of Maximum Degree Three
Gabriel Elvin, Hajrudin Fejzić, Youngsu Kim
We provide a simplified proof of the following special case of Wegner's conjecture: every planar graph of maximum degree at most three admits a distance-2 coloring with at most eig…
math.CO2025
Sharp bounds for product and sum throttling numbers
Ryan Blair, Gabriel Elvin, Veronika Furst +3
Throttling in graphs optimizes a sum or product of resources used, such as the number of vertices in an initial set, and time required, such as the propagation time, to complete a…