Pages that link to "Item:Q3180637"
From MaRDI portal
The following pages link to Counting formulas of perfect matchings of two types of graphs (Q3180637):
Displaying 6 items.
- Counting matchings in graphs (Q579280) (← links)
- \(k\)-noncrossing and \(k\)-nonnesting graphs and fillings of Ferrers diagrams (Q950332) (← links)
- On counting perfect matchings in general graphs (Q2294743) (← links)
- The enumeration of perfect matchings in two types of graphs (Q2927385) (← links)
- Perfect matching counts for \(2\)-\(2n{P_5}\) and \(2\)-\(n{K_{1,1,1,3}}\) graphs (Q3385916) (← links)
- A recursive method for finding the number of perfect matchings of two types of graphs (Q4981040) (← links)