Forcing and anti-forcing polynomials of perfect matchings for some rectangle grids
type: Item
instance of: scholarly article
title: Forcing and anti-forcing polynomials of perfect matchings for some rectangle grids
zbMATH Open document ID: 1406.92793
author: Shuang Zhao
author: Heping Zhang
publication date: 2019-01-31T00:00:00Z
Mathematics Subject Classification ID: 92E10
Mathematics Subject Classification ID: 05C31
Mathematics Subject Classification ID: 05C90
zbMATH DE Number: 7008782
zbMATH Keywords: grid graph
zbMATH Keywords: dimer covering
zbMATH Keywords: perfect matching
zbMATH Keywords: forcing polynomial
zbMATH Keywords: anti-forcing polynomial
MaRDI profile type: Publication
full work available at URL: s10910-018-0944-z
OpenAlex ID: W2888793902
cites work: On the forced matching numbers of bipartite graphs
cites work: On the spectrum of the forced matching number of graphs
cites work: Anti-forcing spectra of perfect matchings of graphs
cites work: Extremal anti-forcing numbers of perfect matchings of graphs
cites work: Statistical Mechanics of Dimers on a Plane Lattice
cites work: The maximum forcing number of cylindrical grid, toroidal 4-8 lattice and Klein bottle 4-8 lattice
cites work: The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
cites work: Dimers and amoebae
cites work: Bounds on the forcing numbers of bipartite graphs
cites work: Anti-forcing numbers of perfect matchings of graphs
cites work: A linear algorithm for a perfect matching in polyomino graphs
cites work: Dimer statistics on the Möbius strip and the Klein bottle
cites work: Close-packed dimers on nonorientable surfaces
cites work: A Minimax Theorem for Directed Graphs
cites work: Forcing matchings on square grids
cites work: The minimum forcing number for the torus and hypercube
cites work: On the maximum forcing and anti-forcing numbers of \((4, 6)\)-fullerenes
cites work: Tight upper bound on the maximum anti-forcing numbers of graphs
cites work: Dimer problem in statistical mechanics-an exact result
cites work: On the anti-forcing number of benzenoids
cites work: On the anti-Kekulé number and anti-forcing number of cata-condensed benzenoids
cites work: Q5408293
cites work: The number of Kekulé structures of polyominos on the torus
cites work: Perfect matchings of polyomino graphs
cites work: Q5279119
cites work: A maximum resonant set of polyomino graphs
cites work: Anti-forcing polynomials for benzenoid systems with forcing edges
cites work: Forcing polynomials of benzenoid parallelogram and its related benzenoids
cites work: A minimax result for perfect matchings of a polyomino graph
cites work: Q5279137
Wikidata QID: Q129321784
DOI: 10.1007/S10910-018-0944-Z
published in: Journal of Mathematical Chemistry
description: scientific article; zbMATH DE number 7008782