22 citations · 92 across the 73 of their papers we have counts for
4 papers · 1 filter
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…
Coloring claw-free graphs with Δ-1 colors
Daniel W. Cranston, Landon Rabern
We prove that every claw-free graph that doesn't contain a clique on vertices can be colored.
Hamiltonicity in connected regular graphs
Daniel W. Cranston, Suil O
In 1980, Jackson proved that every 2-connected -regular graph with at most vertices is Hamiltonian. This result has been extended in several papers. In this note, we determ…
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…