Perfect matchings in bipartite lattice animals: lower bounds and realizability (Q2503702)

From MaRDI portal
Revision as of 20:33, 24 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Perfect matchings in bipartite lattice animals: lower bounds and realizability
scientific article

    Statements

    Perfect matchings in bipartite lattice animals: lower bounds and realizability (English)
    0 references
    0 references
    22 September 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    lattice animal
    0 references
    benzenoid graph
    0 references
    polyomino
    0 references
    perfect matching
    0 references
    lower bound
    0 references
    realizability
    0 references
    0 references