most citedComplexity results for -domination and -domination problems and their variants

2 citations · 2 across the 2 of their papers we have counts for

collaborators
Showing math.COShow all

1 paper · 1 filter

math.CO2026

Asymptotic enumeration of constrained bipartite, directed and oriented graphs by degree sequence

Catherine Greenhill, Mahdieh Hasheminezhad, Isaiah Iliffe +1

In the sufficiently sparse case, we find the probability that a uniformly random bipartite graph with given degree sequence contains no edge from a specified set of edges. This ena…