Vesna Irvsivc Chenoweth

On the Burning Game: Nordhaus-Gaddum Bounds and Graph Products

We continue research on the burning game on graphs. Given a graph $G$, two players, Burner and Staller, take turns in selecting vertices of $G$ to burn. All burned vertices spread fire to unburned neighboring vertices, as in the burning process. The goal of Burner is to burn the graph as quickly as possible, while Stal...