Forcing matchings on square grids

From MaRDI portal
Publication:1584401

DOI10.1016/S0012-365X(97)00266-5zbMath0956.05087MaRDI QIDQ1584401

Lior Pachter, Peter T. Kim

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)




Related Items (32)

A maximum resonant set of polyomino graphsA minimax result for perfect matchings of a polyomino graphThe maximum forcing number of cylindrical grid, toroidal 4-8 lattice and Klein bottle 4-8 latticeMatching Forcing Polynomials of Constructable Hexagonal SystemsContinuous forcing spectrum of regular hexagonal polyhexesComplete forcing numbers of primitive coronoidsGlobal forcing number of benzenoid graphsSome novel minimax results for perfect matchings of hexagonal systemsOn the maximum forcing and anti-forcing numbers of \((4, 6)\)-fullerenesMaximizing the minimum and maximum forcing numbers of perfect matchings of graphsGlobal forcing number for maximal matchingsMaximum fractional forcing number of the powers of even cyclesAnti-forcing spectrum of any cata-condensed hexagonal system is continuousForcing numbers of stop signs.Forcing and anti-forcing polynomials of a type of polyomino graphsOn forcing matching number of boron-nitrogen fullerene graphsForcing and anti-forcing polynomials of perfect matchings for some rectangle gridsThe minimum forcing number of perfect matchings in the hypercubeThe forcing number of toroidal polyhexesOn the anti-forcing number of benzenoidsAnti-forcing spectra of perfect matchings of graphsExtremal anti-forcing numbers of perfect matchings of graphsForcing matching numbers of fullerene graphsThe global forcing number of the parallelogram polyhexContinuous forcing spectra of even polygonal chainsAnti-forcing numbers of perfect matchings of graphsOn the forced matching numbers of bipartite graphsOn the forcing matching numbers of prisms of graphsRelations between global forcing number and maximum anti-forcing number of a graphSome tight bounds on the minimum and maximum forcing numbers of graphsComplete forcing numbers of catacondensed hexagonal systemsBounds on the forcing numbers of bipartite graphs



Cites Work


This page was built for publication: Forcing matchings on square grids