A sufficient condition for Pfaffian graphs on the torus
From MaRDI portal
Publication:1684942
DOI10.1007/s00373-017-1841-0zbMath1441.05181OpenAlexW2755142972MaRDI QIDQ1684942
Mingzu Zhang, Xing Feng, Lian Zhu Zhang
Publication date: 12 December 2017
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-017-1841-0
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Pfaffian graphs embedding on the torus
- The Pfaffian property of circulant graphs
- The complexity of computing the permanent
- Matching theory
- Fluxes, Laplacians, and Kasteleyn's theorem
- Matchings in graphs on non-orientable surfaces
- Pólya's permanent problem
- A characterization of convertible (0,1)-matrices
- A characterisation of Pfaffian near bipartite graphs
- Permanents, Pfaffian orientations, and even directed circuits
- The Pfaffian property of Cartesian products of graphs
- The statistics of dimers on a lattice
- Kasteleyn's Theorem and Arbitrary Graphs
- Dimer problem in statistical mechanics-an exact result
- Tilings of the Torus and the Klein Bottle and Vertex-Transitive Graphs on a Fixed Surface
- Unnamed Item
This page was built for publication: A sufficient condition for Pfaffian graphs on the torus