Counting perfect matchings of cubic graphs in the geometric dual
From MaRDI portal
Publication:6221544
arXiv1010.5918MaRDI QIDQ6221544
Andrea Jiménez, Marcos A. Kiwi
Publication date: 28 October 2010
Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
This page was built for publication: Counting perfect matchings of cubic graphs in the geometric dual