Matching signatures and Pfaffian graphs
From MaRDI portal
Publication:626770
DOI10.1016/j.disc.2010.10.014zbMath1222.05213OpenAlexW2047230065MaRDI QIDQ626770
Alberto Alexandre Assis Miranda, Cláudio Leonardo Lucchesi
Publication date: 18 February 2011
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2010.10.014
Related Items (3)
On the optimality of the Arf invariant formula for graph polynomials ⋮ On discrete field theory properties of the dimer and Ising models and their conformal field theory limits ⋮ On the Pfaffian Number of Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity of computing the permanent
- On the optimality of the Arf invariant formula for graph polynomials
- Matching theory
- On the theory of Pfaffian orientations. I: Perfect matchings and permanents
- Matchings in graphs on non-orientable surfaces
- Pólya's permanent problem
- Permanents, Pfaffian orientations, and even directed circuits
- Drawing 4-Pfaffian graphs on the torus
- The Factorization of Linear Graphs
This page was built for publication: Matching signatures and Pfaffian graphs