Enumerating perfect matchings in inductively-defined families of graphs

zbMATH Open1242.05126MaRDI QIDQ2895337

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)

Related Items (1)

Title not available (Why is that?)

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)