Using edge generating function to solve monomer-dimer problem (Q2221757): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.aam.2020.102082 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Statistical Mechanics of Dimers on a Plane Lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems in algebraic combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of monomer-dimer systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The statistics of dimers on a lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5605168 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching polynomials and duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monomer-dimer problem on random planar honeycomb lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dimer problem in statistical mechanics-an exact result / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration problems for classes of self-similar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of matchings in families of self-similar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted enumeration of spanning subgraphs with degree constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antiferromagnetism. The Triangular Ising Net / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monomer-dimer problem on some networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of matchings of graphs formed by a graph operation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Monomer–Dimer Problem of Some Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the matching polynomial of subdivision graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of perfect matchings of a type of Cartesian products of graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.AAM.2020.102082 / rank
 
Normal rank

Latest revision as of 13:23, 17 December 2024

scientific article
Language Label Description Also known as
English
Using edge generating function to solve monomer-dimer problem
scientific article

    Statements

    Using edge generating function to solve monomer-dimer problem (English)
    0 references
    0 references
    0 references
    2 February 2021
    0 references
    monomer-dimer problem
    0 references
    matching
    0 references
    perfect matching
    0 references
    monomer-dimer generating function
    0 references
    edge generating function
    0 references

    Identifiers