2 papers
math.CO2026
Diamond-free, claw-free cubic graphs are (1, 1, 2, 3)-packing colorable
Sarah E. Anderson, Kirsti Kuenzel, Juan D. Marcano Cuellar
A -packing coloring of a graph is a partition of into two independent sets, a 2-packing, and a -packing. Recently, the question was posed in [A short pr…
math.CO2024
Zero Forcing of Generalized Hierarchical Products of Graphs
Heather LeClair, Tim Spilde, Sarah Anderson +1
Zero forcing is a graph propagation process for which vertices fill-in (or propagate information to) neighbor vertices if all neighbors except for one, are filled. The zero-forcing…