Counting perfect matchings in chain graphs with the specific colored faces

MaRDI QIDQ6500601zbMATH OpenFDO

Authors Supaporn Saduakdee, Pattana Maliwan, Thitaporn Singthong, Supatta Sirilap, Varanoot Khemmani

Publication date 10 May 2024

Published in International Journal of Mathematics and Computer Science (Search for Journal in Brave)

zbMATH Keywords

matchingperfect matchingrecurrence relationchain graphsnake chain graph

Mathematics Subject Classification ID

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

Recommendations

• Using recurrence relation to count a number of perfect matching in linear chain and snake chain graphs
• Enumeration of perfect matchings of a type of 3-regular graphs
• The enumeration of perfect matchings in two types of graphs
• A recursive method for finding the number of perfect matchings of two types of graphs
• Classification and recursive method for perfect matching number of two kinds of special graphs

This page was built for publication: Counting perfect matchings in chain graphs with the specific colored faces

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