34 citations · 63 across the 21 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…
math.CO2012
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…