scientific article; zbMATH DE number 7028012
From MaRDI portal
Publication:4623656
Recommendations
- Four types of nested recursive methods for finding graph perfect matching numbers
- The nested recursive method of analytic formula of the number of perfect matchings for two types of graphs
- A recursive method for finding the number of perfect matchings of two types of graphs
- Counting formulas for the number of perfect matchings of three types of graphs
- Recursive method for perfect matching number in two types of graphs
- The perfect matching number of three types of graphs based on the recursive method of matching a certain vertex classification
- Recurrence calculation of the perfect matchings number of two types of graphs
- The counting formula of the perfect matchings of three types of special graphs
- scientific article; zbMATH DE number 6453473
- Recursive method for perfect matching numbers by matching vertex classification
Cited in
(6)- Counting formulas for the number of perfect matchings of three types of graphs
- The nested recursive method of analytic formula of the number of perfect matchings for two types of graphs
- A recursive method for finding the number of perfect matchings of two types of graphs
- Classification and recursive method for 1-factor number of two kinds of special graphs
- Four types of nested recursive methods for finding graph perfect matching numbers
- Enumeration of perfect matchings of a type of 3-regular graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4623656)