The following pages link to (Q5605168):
Displayed 50 items.
- Matchings in benzene chains (Q594902) (← links)
- An expression for the perfect matching number of cubic \(2\times m\times n\) lattices and their asymptotic values (Q679048) (← links)
- Alternating-sign matrices and domino tilings. II (Q685998) (← links)
- Dimers, tilings and trees (Q705883) (← links)
- Graphical condensation of plane graphs: a combinatorial approach (Q817820) (← links)
- On the theory of matchgate computations (Q841626) (← links)
- On very sparse circulant \((0,1)\) matrices (Q855544) (← links)
- Quadri-tilings of the plane (Q863480) (← links)
- Partition function of periodic isoradial dimer models (Q880944) (← links)
- Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs (Q911300) (← links)
- Minimally non-Pfaffian graphs (Q947729) (← links)
- Efficiently computing the permanent and Hafnian of some banded Toeplitz matrices (Q999813) (← links)
- Dimers on surface graphs and spin structures. II (Q1006870) (← links)
- Shuffling algorithm for boxed plane partitions (Q1011405) (← links)
- Dimers on graphs in non-orientable surfaces (Q1013634) (← links)
- Holographic algorithms: the power of dimensionality resolved (Q1014633) (← links)
- On Kekulé structures count (Q1029738) (← links)
- Loop statistics in the toroidal honeycomb dimer model (Q1035861) (← links)
- Exact arborescences, matchings and cycles (Q1095157) (← links)
- NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems (Q1120597) (← links)
- Negation can be exponentially powerful (Q1143790) (← links)
- An exact upper bound to the maximum number of perfect matchings in cubic pseudographs (Q1164639) (← links)
- Branching random walk in random environment phase transitions for local and global growth rates (Q1187107) (← links)
- How to calculate the number of perfect matchings in finite sections of certain infinite plane graphs (Q1197034) (← links)
- Alternating-sign matrices and domino tilings. I (Q1204334) (← links)
- Fluxes, Laplacians, and Kasteleyn's theorem (Q1312784) (← links)
- The computational complexity of knot and matroid polynomials (Q1313843) (← links)
- Remark on the dimer problem (Q1329818) (← links)
- Perfect matchings and perfect squares (Q1331146) (← links)
- Symmetries of plane partitions and the permanent-determinant method (Q1336443) (← links)
- A fast computer algorithm for finding the permanent of adjacency matrices (Q1360652) (← links)
- Expressions for the perfect matching numbers of cubic \(l\times m\times n\) lattices and their asymptotic values (Q1381251) (← links)
- Generalized domino-shuffling. (Q1401368) (← links)
- Towards a theory of frustrated degeneracy. (Q1408874) (← links)
- On the algebraic complexity of some families of coloured Tutte polynomials (Q1433009) (← links)
- Matchings in graphs on non-orientable surfaces (Q1569077) (← links)
- Strong orientations without even directed circuits (Q1584319) (← links)
- Approximating the number of monomer-dimer coverings of a lattice. (Q1593404) (← links)
- The lifted root number conjecture for fields of prime degree over the rationals: an approach via trees and Euler systems (Q1613960) (← links)
- Critical resonance in the non-intersecting lattice path model (Q1765106) (← links)
- A polyomino tiling problem of Thurston and its configurational entropy (Q1801796) (← links)
- A new proof of a characterisation of Pfaffian bipartite graphs (Q1826958) (← links)
- A characterization of convertible (0,1)-matrices (Q1843571) (← links)
- A characterisation of Pfaffian near bipartite graphs (Q1850543) (← links)
- Computation of sparse circulant permanents via determinants (Q1855364) (← links)
- Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians (Q1883410) (← links)
- Graphs determined by polynomial invariants (Q1885023) (← links)
- The combinatorial approach yields an NC algorithm for computing Pfaffians (Q1887034) (← links)
- A new approach to solving three combinatorial enumeration problems on planar graphs (Q1894355) (← links)
- A quadratic identity for the number of perfect matchings of plane graphs (Q2378519) (← links)