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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10910-011-9900-x / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 92E10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C70 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C90 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6040021 / rank
 
Normal rank
Property / zbMATH Keywords
 
perfect matching
Property / zbMATH Keywords: perfect matching / rank
 
Normal rank
Property / zbMATH Keywords
 
essentially disconnected
Property / zbMATH Keywords: essentially disconnected / rank
 
Normal rank
Property / zbMATH Keywords
 
lower bound
Property / zbMATH Keywords: lower bound / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10910-011-9900-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2075546798 / rank
 
Normal rank
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
Property / DOI
 
Property / DOI: 10.1007/S10910-011-9900-X / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:10, 9 December 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