4 citations · 10 across the 7 of their papers we have counts for
1 paper · 1 filter
Rolando Ramirez Camasca, John McGreevy
The dimer tiling problem asks in how many ways can the edges of a graph be covered by dimers so that each site is covered once. In the special case of a planar graph, this problem…