2 papers
math.CO2025
Full classification of anti-van der Waerden numbers of graph products of forests
Zhanar Berikkyzy, Joe Miller, Nathan Warnberg
The anti-van der Waerden number of a graph is the fewest number of colors needed to guarantee a rainbow -term arithmetic progression in , denoted …
math.CO2024
Zero Forcing and Vertex Independence Number on Cubic and Subcubic Graphs
Houston Schuerger, Nathan Warnberg, Michael Young
Motivated by a conjecture from the automated conjecturing program TxGraffiti, in this paper the relationship between the zero forcing number, , and the vertex independence nu…