scientific article; zbMATH DE number 15371
From MaRDI portal
Publication:3972015
zbMATH Open0735.05067MaRDI QIDQ3972015FDOQ3972015
Publication date: 25 June 1992
Title of this publication is not available (Why is that?)
Recommendations
Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (20)
- Expressions for the perfect matching numbers of cubic \(l\times m\times n\) lattices and their asymptotic values
- Counting matchings in graphs
- Perfect Matchings of the Small Polyominoes
- A lower bound on the number of elementary components of essentially disconnected generalized polyomino graphs
- Perfect matchings in random polyomino chain graphs
- The 2-matching lattice of a graph
- Remark on the dimer problem
- Perfect matchings of polyomino graphs
- Algorithmic Applications in Management
- The number of matchings of low order in hexagonal systems
- The number of Kekulé structures of polyominos on the torus
- Direct sum of distributive lattices on the perfect matchings of a plane bipartite graph
- On \(k\)-resonance of grid graphs on the plane, torus and cylinder
- On maximal resonance of polyomino graphs
- Perfect matchings in the triangular lattice
- A distributive lattice on the set of perfect matchings of a plane bipartite graph
- Enumeration of Wiener indices in random polygonal chains
- Perfect matchings of generalized polyomino graphs
- On counting perfect matchings in general graphs
- How to calculate the number of perfect matchings in finite sections of certain infinite plane graphs
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)
