Classification and recursive method for perfect matching number of two kinds of special graphs

DOI10.3969/J.ISSN.1001-4616.2021.01.001MaRDI QIDQ4996038zbMATH OpenFDO

Authors Baoxiang Tang, Han Ren

Publication date 1 July 2021

zbMATH Keywords

general solutionperfect matchingrecurrence formula

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Perfect graphs (05C17)

Recommendations

• Recursive method for perfect matching number in two types of graphs
• Perfect matching number of two kinds of graphs based on recursive method of matching vertex classification
• Recursive method for perfect matching numbers by matching vertex classification
• The perfect matching number of three types of graphs based on the recursive method of matching a certain vertex classification
• A recursive method for finding the number of perfect matchings of two types of graphs

Cited in

(8)

• A recursive method for perfect matching number classified with saturation of a certain vertex
• The perfect matching number of three types of graphs based on the recursive method of matching a certain vertex classification
• Perfectly Matchable Set Polynomials and $h^*$-polynomials for Stable Set Polytopes of Complements of Graphs
• Recursive method for perfect matching numbers by matching vertex classification
• Using recurrence relation to count a number of perfect matching in linear chain and snake chain graphs
• Recursive method for perfect matching number in two types of graphs
• Perfect matching number of two kinds of graphs based on recursive method of matching vertex classification
• Counting perfect matchings in chain graphs with the specific colored faces

This page was built for publication: Classification and recursive method for perfect matching number of two kinds of special graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4996038)