35 citations · 69 across the 35 of their papers we have counts for
Showing 2012 · math.COShow all
2 papers · 2 filters
math.CO2012★ 5 cited
Weak and Strong k-connectivity games
Asaf Ferber, Dan Hefetz
For a positive integer we consider the -vertex-connectivity game, played on the edge set of , the complete graph on vertices. We first study the Maker-Breaker versi…
math.CO2012★ 3 cited
Optimal covers with Hamilton cycles in random graphs
Dan Hefetz, Daniela Kühn, John Lapinskas +1
A packing of a graph G with Hamilton cycles is a set of edge-disjoint Hamilton cycles in G. Such packings have been studied intensively and recent results imply that a largest pack…