A minimax result for perfect matchings of a polyomino graph
From MaRDI portal
Publication:277641
DOI10.1016/j.dam.2016.01.033zbMath1335.05039OpenAlexW2280027996MaRDI QIDQ277641
Publication date: 2 May 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.01.033
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Polyominoes (05B50)
Related Items
Maximizing the minimum and maximum forcing numbers of perfect matchings of graphs ⋮ On degree-based topological indices of random polyomino chains ⋮ Forcing and anti-forcing polynomials of perfect matchings for some rectangle grids ⋮ Relations between global forcing number and maximum anti-forcing number of a graph ⋮ On the Steiner hyper-Wiener index of a graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A maximum resonant set of polyomino graphs
- Unimodularity of the Clar number problem
- A min-max result on outerplane bipartite graphs
- Relations between Clar structures, Clar covers, and the sextet-rotation tree of a hexagonal system
- Extremal fullerene graphs with the maximum Clar number
- An upper bound for the Clar number of fullerene graphs
- A maximal cover of hexagonal systems
- Matching theory
- Combinatorial properties of polyominoes
- Chessboard domination problems
- On the queen domination problem
- Perfect matchings of polyomino graphs
- Plane elementary bipartite graphs
- Forcing matchings on square grids
- The connectivity of \(Z\)-transformation graphs of perfect matchings of polyominoes
- Normal components, Kekulé patterns, and Clar patterns in plane bipartite graphs
- On maximal resonance of polyomino graphs
- Perfect matchings of generalized polyomino graphs
- The statistics of dimers on a lattice
- King and domino polynomials for polyomino graphs
- On the spectrum of the forced matching number of graphs
