Pages that link to "Item:Q2378519"
From MaRDI portal
The following pages link to A quadratic identity for the number of perfect matchings of plane graphs (Q2378519):
Displaying 11 items.
- Variations on a theme of Kasteleyn, with application to the totally nonnegative Grassmannian (Q281632) (← links)
- Maximum matchings in scale-free networks with identical degree distribution (Q528496) (← links)
- Applications of graphical condensation for enumerating matchings and tilings (Q596044) (← links)
- Graphical condensation of plane graphs: a combinatorial approach (Q817820) (← links)
- How to calculate the number of perfect matchings in finite sections of certain infinite plane graphs (Q1197034) (← links)
- Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs (Q1676361) (← links)
- On the construction of graphs with a planar bipartite double cover from Boolean formulas and its application to counting satisfying solutions (Q1704571) (← links)
- Graphical condensation for enumerating perfect matchings (Q1775549) (← links)
- A generalization of Kuo condensation (Q2347980) (← links)
- Pfaffian orientations and perfect matchings of scale-free networks (Q2514127) (← links)
- (Q4502711) (← links)