Recursive method for perfect matching numbers by matching vertex classification

DOI10.13413/J.CNKI.JDXBLXB.2018359MaRDI QIDQ5209588zbMATH OpenFDO

Authors Baoxiang Tang, Han Ren

Publication date 22 January 2020

Full work available at URL https://doi.org/10.13413/J.CNKI.JDXBLXB.2018359

zbMATH Keywords

classificationgeneral solutionperfect matchingrecursive relation

Mathematics Subject Classification ID

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

Recommendations

• Perfect matching number of two kinds of graphs based on recursive method of matching vertex classification
• 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
• Classification and recursive method for perfect matching number of two kinds of special graphs
• A recursive method for perfect matching number classified with saturation of a certain vertex

Cited in

(7)

• A recursive method for perfect matching number classified with saturation of a certain vertex
• Recursive method for the number of 1-factors in graphs
• The perfect matching number of three types of graphs based on the recursive method of matching a certain vertex classification
• scientific article; zbMATH DE number 7028012 (Why is no real title available?)
• Classification and recursive method for perfect matching number of two kinds of special 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

This page was built for publication: Recursive method for perfect matching numbers by matching vertex classification

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