Forcing matchings on square grids (Q1584401): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Peter T. Kim / rank
Normal rank
 
Property / author
 
Property / author: Peter T. Kim / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4888115 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compositions of Graphs and Polyhedra IV: Acyclic Spanning Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of perfect matchings in graphs with reflective symmetry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Centroids, Representations, and Submodular Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pick's Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Minimax Theorem for Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Z-transformation graphs of perfect matchings of hexagonal systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hexagonal systems with forcing edges / rank
 
Normal rank

Latest revision as of 16:06, 30 May 2024

scientific article
Language Label Description Also known as
English
Forcing matchings on square grids
scientific article

    Statements

    Forcing matchings on square grids (English)
    0 references
    0 references
    0 references
    2 November 2000
    0 references
    domino tiling
    0 references
    perfect matching
    0 references
    forcing number
    0 references
    minimum feedback set problem
    0 references

    Identifiers