Sequences of matchings in path-type graphs

MaRDI QIDQ3110091zbMATH OpenFDO

Authors Krop Elliot, Sarah Heuss Holliday

Publication date 26 January 2012

zbMATH Keywords

Fibonacci numbersnumber of matchings

Mathematics Subject Classification ID

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

Recommendations

• Enumerating perfect matchings in inductively-defined families of graphs
• Counting matchings in graphs
• scientific article; zbMATH DE number 1279034
• \((k,\alpha _{n-1})\)-Fibonacci numbers and \(P_k\)-matchings in multigraphs.
• On generalized Fibonacci numbers and \(k\)-distance \(K_p\)-matchings in graphs

Cited in

(3)

• Enumerating perfect matchings in inductively-defined families of graphs
• Cyclic matching sequencibility of graphs
• A direct encoding of Stoimenow's matchings as ascent sequences

This page was built for publication: Sequences of matchings in path-type graphs

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