Pfaffian orientations 0-1 permanents, and even cycles in directed graphs
Discrete Applied Mathematics - Combinatorics and complexity
Matchings in graphs on non-orientable surfaces
Journal of Combinatorial Theory Series B
Which crossing number is it anyway?
Journal of Combinatorial Theory Series B
Journal of Combinatorial Theory Series B
Hi-index | 0.00 |
We prove that a graph is Pfaffian if and only if it can be drawn in the plane (possibly with crossings) so that every perfect matching intersects itself an even number of times.