The following pages link to (Q3170050):
Displaying 18 items.
- Enumerating perfect matchings in \(n\)-cubes (Q382880) (← links)
- On the number of disjoint perfect matchings of regular graphs with given edge connectivity (Q729759) (← links)
- On the number of matchings of graphs formed by a graph operation (Q867792) (← links)
- On the upper bounds of the numbers of perfect matchings in graphs with given parameters (Q871682) (← links)
- Exact and asymptotic enumeration of perfect matchings in self-similar graphs (Q1045201) (← links)
- How to calculate the number of perfect matchings in finite sections of certain infinite plane graphs (Q1197034) (← links)
- On the number of perfect matchings of line graphs (Q1946221) (← links)
- Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number (Q2231756) (← links)
- On counting perfect matchings in general graphs (Q2294743) (← links)
- Enumeration of perfect matchings of lattice graphs by Pfaffians (Q2335766) (← links)
- Perfect matchings on a type of lattices with toroidal boundary (Q2422643) (← links)
- Enumeration of perfect matchings of a type of Cartesian products of graphs (Q2581564) (← links)
- The enumeration of perfect matchings in two types of graphs (Q2927385) (← links)
- (Q4815828) (← links)
- (Q4925979) (← links)
- (Q5308329) (← links)
- Enumeration of maximum matchings in the Hanoi graphs using matching polynomials (Q6059080) (← links)
- The number of perfect matchings, and the nesting properties, of random regular graphs (Q6076217) (← links)
