3 papers
math.CO2026
On the damage number of graphs
Valentin Gledel, William B. Kinnersley, Balázs Patkós +1
We study a variant of Cops and Robbers in which the robber attempts to visit as many vertices of the graph as possible without being captured, while the cop aims to keep the robber…
math.CO2025
Limited-visibility Cops and Robbers on Hamming graphs
John Jones, William B. Kinnersley
In the classic game of Cops and Robbers, a team of cops pursues a robber through a graph. The traditional model of Cops and Robbers operates under the assumption that the cops know…
math.CO2024
Burning game
Nina Chiarelli, Vesna IrÅ¡iÄ, Marko Jakovac +2
Motivated by the burning and cooling processes, the burning game is introduced. The game is played on a graph by the two players (Burner and Staller) that take turns selecting…