A minimax result for perfect matchings of a polyomino graph (Q277641): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05B50 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C70 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6575686 / rank
 
Normal rank
Property / zbMATH Keywords
 
polyomino graph
Property / zbMATH Keywords: polyomino graph / rank
 
Normal rank
Property / zbMATH Keywords
 
perfect matching
Property / zbMATH Keywords: perfect matching / rank
 
Normal rank
Property / zbMATH Keywords
 
resonant set
Property / zbMATH Keywords: resonant set / rank
 
Normal rank
Property / zbMATH Keywords
 
forcing number
Property / zbMATH Keywords: forcing number / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2016.01.033 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2280027996 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unimodularity of the Clar number problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the spectrum of the forced matching number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial properties of polyominoes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4903414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings of generalized polyomino graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chessboard domination problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the queen domination problem / 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: On maximal resonance of polyomino graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / 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: Forcing matchings on square grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal components, Kekulé patterns, and Clar patterns in plane bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5408293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal fullerene graphs with the maximum Clar number / 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: A min-max result on outerplane bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for the Clar number of fullerene graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings of polyomino graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Plane elementary bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A maximum resonant set of polyomino graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A maximal cover of hexagonal systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5279137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relations between Clar structures, Clar covers, and the sextet-rotation tree of a hexagonal system / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:17, 11 July 2024

scientific article
Language Label Description Also known as
English
A minimax result for perfect matchings of a polyomino graph
scientific article

    Statements

    A minimax result for perfect matchings of a polyomino graph (English)
    0 references
    0 references
    0 references
    2 May 2016
    0 references
    0 references
    polyomino graph
    0 references
    perfect matching
    0 references
    resonant set
    0 references
    forcing number
    0 references
    0 references