Graphical condensation for enumerating perfect matchings (Q1775549): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Enumeration of perfect matchings in graphs with reflective symmetry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings of cellular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complementation theorem for perfect matchings of graphs having a cellular completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3816119 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating-sign matrices and domino tilings. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5753988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3807048 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of graphical condensation for enumerating matchings and tilings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized domino-shuffling. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938474 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dodgon's determinant-evaluation rule proved by TWO-TIMING MEN and WOMEN / rank
 
Normal rank

Latest revision as of 10:50, 10 June 2024

scientific article
Language Label Description Also known as
English
Graphical condensation for enumerating perfect matchings
scientific article

    Statements

    Graphical condensation for enumerating perfect matchings (English)
    0 references
    0 references
    0 references
    4 May 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    Graphical condensation
    0 references
    Perfect matching
    0 references
    Symmetric graph
    0 references
    Aztec diamond
    0 references
    Plane partition
    0 references
    0 references