scientific article; zbMATH DE number 15371
From MaRDI portal
Publication:3972015
Recommendations
Cited in
(21)- The 2-matching lattice of a graph
- How to calculate the number of perfect matchings in finite sections of certain infinite plane graphs
- Remark on the dimer problem
- Perfect matchings of polyomino graphs
- Expressions for the perfect matching numbers of cubic l m n lattices and their asymptotic values
- A distributive lattice on the set of perfect matchings of a plane bipartite graph
- The number of matchings of low order in hexagonal systems
- Enumeration of Wiener indices in random polygonal chains
- Perfect matchings in the triangular lattice
- On maximal resonance of polyomino graphs
- The number of Kekulé structures of polyominos on the torus
- On counting perfect matchings in general graphs
- Perfect matchings of generalized polyomino graphs
- Perfect matchings in random polyomino chain graphs
- Perfect Matchings of the Small Polyominoes
- A lower bound on the number of elementary components of essentially disconnected generalized polyomino graphs
- Matchings in Lattice Graphs and Hamming Graphs
- On \(k\)-resonance of grid graphs on the plane, torus and cylinder
- Algorithmic Applications in Management
- Counting matchings in graphs
- Direct sum of distributive lattices on the perfect matchings of a plane bipartite graph
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3972015)
