All Questions
Tagged with pfaffian perfect-matchings
1 question
4
votes
1
answer
181
views
Algorithms to count perfect matchings in near planar graphs
It is well known that counting perfect matchings is tractable in planar graphs (due to Kastelyn).
I am interested in classes of (for lack of a better word) "near" planar graphs (1-planar, ...
- 129