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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Combinatorial properties of polyominoes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chessboard domination problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3813830 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings of generalized polyomino graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the queen domination problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5749300 / 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: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure character of essentially disconnected polyomino graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: King and domino polynomials for polyomino graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory -- a sampler: From Dénes König to the present / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938474 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3972015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elementary components of essentially disconnected polyomino graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings of polyomino graphs / rank
 
Normal rank

Revision as of 06:32, 5 July 2024

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