Perfect matchings of polyomino graphs (Q1376069): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Matching theory / 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 -- a sampler: From Dénes König to the present / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5749300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3972015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial properties of polyominoes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The connectivity of \(Z\)-transformation graphs of perfect matchings of polyominoes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings in hexagonal systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theorem concerning perfect matchings in hexagonal systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3743338 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Plane elementary bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: When each hexagon of a hexagonal system covers it / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for perfect matching in hexagonal systems / rank
 
Normal rank

Latest revision as of 09:17, 28 May 2024

scientific article
Language Label Description Also known as
English
Perfect matchings of polyomino graphs
scientific article

    Statements

    Perfect matchings of polyomino graphs (English)
    0 references
    0 references
    0 references
    14 September 1998
    0 references
    A characterization of polyominoes having a perfect matching resp. being elementary is given. This allows to give a special decomposition of non-elementary polyominoes with perfect matchings into elementary subpolyominoes such that the number of perfect matchings of the original graph is the product of those of the latter graphs.
    0 references
    polyominoes
    0 references
    perfect matching
    0 references

    Identifiers