Enumerating perfect matchings in inductively-defined families of graphs

MaRDI QIDQ2895337zbMATH OpenFDO

Authors John C. George, Walter D. Wallis

Publication date 2 July 2012

Published in JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Recommendations

• Sequences of matchings in path-type graphs
• Some results on one type of graph family with some special number sequences
• Recurrence calculation of the perfect matchings number of two types of graphs
• scientific article; zbMATH DE number 4193732
• The enumeration of perfect matchings in two types of graphs

Cited in

(4)

• Sequences of matchings in path-type graphs
• Enumeration of Matchings in the Incidence Graphs of Complete and Complete Bipartite Graphs
• Some results on one type of graph family with some special number sequences
• scientific article; zbMATH DE number 5196300 (Why is no real title available?)

This page was built for publication: Enumerating perfect matchings in inductively-defined families of graphs

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