8 citations · 33 across the 46 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
math.CO2012★ 1 cited
Game matching number of graphs
Daniel W. Cranston, William B. Kinnersley, Suil O. +1
We study a competitive optimization version of , the maximum size of a matching in a graph . Players alternate adding edges of to a matching until it becomes a maxima…
cs.DM2012★ 1 cited
Revolutionaries and spies: Spy-good and spy-bad graphs
Jane V. Butterfield, Daniel W. Cranston, Gregory J. Puleo +2
We study a game on a graph played by {\it revolutionaries} and {\it spies}. Initially, revolutionaries and then spies occupy vertices. In each subsequent round, each re…