Pages that link to "Item:Q2874581"
From MaRDI portal
The following pages link to Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique (Q2874581):
Displaying 6 items.
- How to calculate the number of perfect matchings in finite sections of certain infinite plane graphs (Q1197034) (← links)
- Disjoint compatible geometric matchings (Q1942309) (← links)
- Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique (Q1946734) (← links)
- On numbers of pseudo-triangulations (Q1947983) (← links)
- Counting Plane Graphs: Flippability and Its Applications (Q2847913) (← links)
- An Empirical Study on Randomized Optimal Area Polygonization of Planar Point Sets (Q5266598) (← links)