344 citations · 1.3k across the 59 of their papers we have counts for
1 paper · 1 filter
Richard W. Kenyon, David B. Wilson
Given a finite planar graph, a grove is a spanning forest in which every component tree contains one or more of a specified set of vertices (called nodes) on the outer face. For th…