A maximum resonant set of polyomino graphs
From MaRDI portal
Publication:274682
DOI10.7151/dmgt.1857zbMath1334.05122arXiv1411.7126OpenAlexW1553877994MaRDI QIDQ274682
Publication date: 25 April 2016
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1411.7126
Applications of graph theory (05C90) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Related Items (5)
A minimax result for perfect matchings of a polyomino graph ⋮ Forcing and anti-forcing polynomials of a type of polyomino graphs ⋮ 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 ⋮ Some tight bounds on the minimum and maximum forcing numbers of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A lower bound on the number of elementary components of essentially disconnected generalized polyomino graphs
- The connectivity of Z-transformation graphs of perfect matchings of hexagonal systems
- Elementary components of essentially disconnected polyomino graphs
- Unimodularity of the Clar number problem
- A maximal cover of hexagonal systems
- Matching theory
- Combinatorial properties of polyominoes
- Chessboard domination problems
- On the queen domination problem
- Remark on the dimer 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
- On maximal resonance of polyomino graphs
- The statistics of dimers on a lattice
- Statistical Mechanics of Dimers on a Plane Lattice
- King and domino polynomials for polyomino graphs
- Dimers on two types of lattices on the Klein bottle
- Perfect matchings in hexagonal systems
This page was built for publication: A maximum resonant set of polyomino graphs