On the theory of Pfaffian orientations. II: \(T\)-joins, \(k\)-cuts, and duality of enumeration

zbMath0909.05006MaRDI QIDQ1277144

Martin Loebl, Anna Galluccio

Publication date: 2 February 1999

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/119699

zbMATH Keywords

generating functionPfaffianperfect matching\(T\)-join\(k\)-cut

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)

Related Items

The combinatorial approach yields an NC algorithm for computing Pfaffians, Drawing 4-Pfaffian graphs on the torus, Dimers on surface graphs and spin structures. I, On the optimality of the Arf invariant formula for graph polynomials, Weakly nonplanar dimers, Almost exact matchings, Towards a theory of frustrated degeneracy., Unnamed Item, Maximum Cut Parameterized by Crossing Number, Discrete Dirac operators, critical embeddings and Ihara-Selberg functions, Pfaffian graphs, \(T\)-joins and crossing numbers, The critical Ising model via Kac-Ward matrices, Critical resonance in the non-intersecting lattice path model, Unnamed Item, Geometric representations of linear codes, Dimers on surface graphs and spin structures. II, A new connection between quantum circuits, graphs and the Ising partition function, Dimers on graphs in non-orientable surfaces, Notes on graph product structure theory, Compressed Decision Problems in Hyperbolic Groups., Planar Maximum Matching: Towards a Parallel Algorithm, Computation of sparse circulant permanents via determinants