Counting over non-planar graphs

DOI10.1016/S0378-4371(01)00445-9zbMath0980.68079WikidataQ61444460 ScholiaQ61444460MaRDI QIDQ5951424

Riccardo Zecchina

Publication date: 6 January 2002

Published in: Physica A (Search for Journal in Brave)

zbMATH Keywords

combinatoricstopologyPfaffian formalism

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items

Computational complexity of impact size estimation for spreading processes on networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of computing the permanent
• Matching theory
• Theory of monomer-dimer systems
• Polynomial-Time Approximation Algorithms for the Ising Model
• Approximating the Permanent
• The Complexity of Enumeration and Reliability Problems
• Characteristic Classes. (AM-76)
• Statistical Field Theory
• Dimer problem in statistical mechanics-an exact result
• Determining computational complexity from characteristic ‘phase transitions’
• Negative Finding for the Three-Dimensional Dimer Problem
• A Combinatorial Solution of the Two-Dimensional Ising Model
• Crystal Statistics. I. A Two-Dimensional Model with an Order-Disorder Transition