7 citations · 15 across the 8 of their papers we have counts for
1 paper · 1 filter
Martin Dyer, Haiko Müller
We examine the problem of exactly or approximately counting all perfect matchings in hereditary classes of nonbipartite graphs. In particular, we consider the switch Markov chain o…