Counting over non-planar graphs

DOI10.1016/S0378-4371(01)00445-9MaRDI QIDQ5951424zbMATH OpenWikidataFDO

Authors Riccardo Zecchina

Publication date 6 January 2002

Published in Physica A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0378-4371(01)00445-9

zbMATH Keywords

topologycombinatoricsPfaffian formalism

Mathematics Subject Classification ID

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

Recommendations

• Publication:4938661
• Matching signatures and Pfaffian graphs
• Combinatorial and topological approach to the 3D Ising model
• A Pfaffian formula for the Ising partition function of surface graphs
• Enumeration of perfect matchings of lattice graphs by Pfaffians

Cites work

• scientific article; zbMATH DE number 3888913 (Why is no real title available?)
• scientific article; zbMATH DE number 15994 (Why is no real title available?)
• scientific article; zbMATH DE number 3621932 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 5050923 (Why is no real title available?)
• scientific article; zbMATH DE number 3248840 (Why is no real title available?)
• scientific article; zbMATH DE number 3326387 (Why is no real title available?)
• scientific article; zbMATH DE number 3386710 (Why is no real title available?)
• A Combinatorial Solution of the Two-Dimensional Ising Model
• Approximating the Permanent
• Characteristic Classes. (AM-76)
• Combinatorial matrix theory
• Crystal Statistics. I. A Two-Dimensional Model with an Order-Disorder Transition
• Determining computational complexity from characteristic ``phase transitions
• Dimer problem in statistical mechanics-an exact result
• Matching theory
• Negative Finding for the Three-Dimensional Dimer Problem
• Polynomial-Time Approximation Algorithms for the Ising Model
• Statistical Field Theory
• The Complexity of Enumeration and Reliability Problems
• The complexity of computing the permanent
• Theory of monomer-dimer systems

Cited in

(8)

• Counting Plane Graphs: Cross-Graph Charging Schemes
• Computational complexity of impact size estimation for spreading processes on networks
• A Pfaffian formula for the Ising partition function of surface graphs
• Universality and asymptotics of graph counting problems in non-orientable surfaces
• Combinatorial and topological approach to the 3D Ising model
• Counting irregular multigraphs
• scientific article; zbMATH DE number 2151256 (Why is no real title available?)
• Counting disk graphs

This page was built for publication: Counting over non-planar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5951424)