activity
20132026
most citedAssigning times to minimise reachability in temporal graphs

27 citations · 73 across the 20 of their papers we have counts for

collaborators
Showing 2013Show all

2 papers · 1 filter

math.CO2013

Avoider-Enforcer star games

Andrzej Grzesik, Mirjana Mikalački, Zoltán Lóránt Nagy +3

In this paper, we study Avoider-Enforcer games played on the edge set of the complete graph on vertices. For every constant we analyse the -star game, wh…

math.CO2013★ 10 cited

Degree sequences of random digraphs and bipartite graphs

Brendan D. McKay, Fiona Skerman

We investigate the joint distribution of the vertex degrees in three models of random bipartite graphs. Namely, we can choose each edge with a specified probability, choose a speci…