Counting matchings in graphs

DOI10.1016/0016-0032(87)90046-9zbMath0625.05040OpenAlexW2087792609MaRDI QIDQ579280

E. J. Farrell

Publication date: 1987

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0016-0032(87)90046-9

zbMATH Keywords

matching polynomialcounting matchings

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Enumeration problems for classes of self-similar graphs

Cites Work

• Unnamed Item
• Matching polynomials: A matrix approach and its applications
• An introduction to matching polynomials

This page was built for publication: Counting matchings in graphs