most citedCop-Win Graphs: Optimal Strategies and Corner Rank

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

collaborators
Showing math.COShow all

2 papers · 1 filter

math.CO2023

Cycle decompositions of cartesian products of two cycles

Moriah Aberle, Sarah Gold, Rivkah Moshe +1

We say a graph decomposes a graph if there exists a partition of the edges of into subgraphs isomorphic to . We seek to characterize necessary and sufficient conditi…

math.CO2016★ 2 cited

Cop-Win Graphs: Optimal Strategies and Corner Rank

David Offner, Kerry Ojakian

We investigate the game of cops and robber, played on a finite graph, between one cop and one robber. If the cop can force a win on a graph, the graph is called cop-win. We describ…