Publication:5605168
From MaRDI portal
zbMath0205.28402MaRDI QIDQ5605168
Publication date: 1967
05C90: Applications of graph theory
Related Items
On the computational complexity of the Jones and Tutte polynomials, TOWARDS A QUANTUM ALGORITHM FOR THE PERMANENT, On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices, Counting over non-planar graphs, Dimers and the critical Ising model on lattices of genus \(>1\), Matchings in benzene chains, An expression for the perfect matching number of cubic \(2\times m\times n\) lattices and their asymptotic values, Alternating-sign matrices and domino tilings. II, Dimers, tilings and trees, Graphical condensation of plane graphs: a combinatorial approach, On very sparse circulant \((0,1)\) matrices, Quadri-tilings of the plane, Partition function of periodic isoradial dimer models, Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs, Exact arborescences, matchings and cycles, NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems, Negation can be exponentially powerful, An exact upper bound to the maximum number of perfect matchings in cubic pseudographs, Branching random walk in random environment phase transitions for local and global growth rates, How to calculate the number of perfect matchings in finite sections of certain infinite plane graphs, Alternating-sign matrices and domino tilings. I, Fluxes, Laplacians, and Kasteleyn's theorem, The computational complexity of knot and matroid polynomials, Remark on the dimer problem, Perfect matchings and perfect squares, Symmetries of plane partitions and the permanent-determinant method, A fast computer algorithm for finding the permanent of adjacency matrices, Expressions for the perfect matching numbers of cubic \(l\times m\times n\) lattices and their asymptotic values, Generalized domino-shuffling., Towards a theory of frustrated degeneracy., On the algebraic complexity of some families of coloured Tutte polynomials, Matchings in graphs on non-orientable surfaces, Strong orientations without even directed circuits, Approximating the number of monomer-dimer coverings of a lattice., The lifted root number conjecture for fields of prime degree over the rationals: an approach via trees and Euler systems, Critical resonance in the non-intersecting lattice path model, A polyomino tiling problem of Thurston and its configurational entropy, A new proof of a characterisation of Pfaffian bipartite graphs, A characterization of convertible (0,1)-matrices, A characterisation of Pfaffian near bipartite graphs, Computation of sparse circulant permanents via determinants, Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians, Graphs determined by polynomial invariants, The combinatorial approach yields an NC algorithm for computing Pfaffians, A new approach to solving three combinatorial enumeration problems on planar graphs, Valiant's holant theorem and matchgate tensors, Computational complexity of counting problems on 3-regular planar graphs, Replacing Pfaffians and applications, Dimers on surface graphs and spin structures. I, Pattern densities in non-frozen planar dimer models, Pseudo-centrosymmetric matrices, with applications to counting perfect matchings, Non-colliding paths in the honeycomb dimer model and the Dyson process, On hearing the shape o f combinatorial drums, Advanced determinant calculus: a complement, Enumeration of perfect matchings of a type of Cartesian products of graphs, Generating bricks, AMOEBAS AND INSTANTONS, On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth (Extended Abstract), Factors and factorizations of graphs—a survey, Unnamed Item, On the evolution of random graphs over expanding square lattices, The Even Cycle Problem for Directed Graphs
