Counting perfect matchings in the geometric dual

DOI10.1016/j.endm.2011.05.039zbMath1268.05108OpenAlexW2029922317MaRDI QIDQ2840713

Andrea Jiménez, Marcos A. Kiwi

Publication date: 23 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2011.05.039

zbMATH Keywords

Ising modelperfect matchingscubic planar graphLovasz-Plummer conjecture

Mathematics Subject Classification ID

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

Related Items

Non-degenerated ground states and low-degenerated excited states in the antiferromagnetic Ising model on triangulations, Berge-Fulkerson conjecture on certain snarks

Cites Work

• Unnamed Item
• Exponentially many perfect matchings in cubic graphs
• Satisfying states of triangulations of a convex \(n\)-gon
• Perfect matchings in planar cubic graphs
• Graph Classes: A Survey