Recursive method for the number of 1-factors in graphs

MaRDI QIDQ3307171zbMATH OpenFDO

Authors Baoxiang Tang, Han Ren

Publication date 12 August 2020

zbMATH Keywords

1-factorcharacteristic equationgeneral solutionlinear recurrence relation

Mathematics Subject Classification ID

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

Recommendations

• Classification and recursive method for 1-factor number of two kinds of special graphs
• scientific article; zbMATH DE number 6129517
• scientific article; zbMATH DE number 3843796
• 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

Cited in

(2)

• scientific article; zbMATH DE number 3843796 (Why is no real title available?)
• Classification and recursive method for 1-factor number of two kinds of special graphs

This page was built for publication: Recursive method for the number of 1-factors in graphs

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