A lower bound on the number of elementary components of essentially disconnected generalized polyomino graphs (Q424181)

From MaRDI portal
Revision as of 23:09, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
A lower bound on the number of elementary components of essentially disconnected generalized polyomino graphs
scientific article

    Statements

    A lower bound on the number of elementary components of essentially disconnected generalized polyomino graphs (English)
    0 references
    0 references
    31 May 2012
    0 references
    perfect matching
    0 references
    essentially disconnected
    0 references
    lower bound
    0 references

    Identifiers