Jonathan D. Lee

most citedNew

F

-Saturation Games on Directed Graphs

3 citations · 3 across the 3 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2022

Coarse geometry of the Cops and robber game

Jonathan Lee, Eduardo Martínez-Pedroza, Juan Felipe Rodríguez-Quinche

We introduce two variations of the cops and robber game on graphs. These games yield two invariants in $Z_{+} \cup {\infty}$ for any connected graph $Γ$ , the {weak cop numbe…

math.CO2014★ 3 cited

New $F$ -Saturation Games on Directed Graphs

Jonathan D. Lee, Ago-Erik Riet

We study analogues of $F$ -saturation games, first introduced by Furedi, Reimer and Seress in 1991, and named as such by West. We examine analogous games on directed graph…

math.CO2014

F-Saturation Games

Jonathan D. Lee, Ago-Erik Riet

We study F-saturation games, first introduced by Füredi, Reimer and Seress in 1991, and named as such by West. The main question is to determine the length of the game whilst avoid…

Coarse geometry of the Cops and robber game

New F-Saturation Games on Directed Graphs

F-Saturation Games

New $F$ -Saturation Games on Directed Graphs