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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Normal components, Kekulé patterns, and Clar patterns in plane bipartite graphs / rank
 
Normal rank

Latest revision as of 20:33, 24 June 2024

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
    lattice animal
    0 references
    benzenoid graph
    0 references
    polyomino
    0 references
    perfect matching
    0 references
    lower bound
    0 references
    realizability
    0 references

    Identifiers