2 papers
math.CO2025
On the -forcing number: computational approach and exact values
Aida Abiad, Maryam Moghaddas
Zero forcing is a graph coloring process that is used to model spreading phenomena in real-world scenarios. It can also be viewed as a single-player combinatorial game on a graph,…
cs.DS2024
Fast FPT Algorithms for Grundy Number on Dense Graphs
Sina Ghasemi Nezhad, Maryam Moghaddas, Fahad Panolan
In this paper, we investigate the \textsc{Grundy Coloring} problem for graphs with a cluster modulator, a structure commonly found in dense graphs. The Grundy chromatic number, rep…