The maximum forcing number of a polyomino

MaRDI QIDQ4595660zbMATH OpenFDO

Authors Mujiangshan Wang, Liqiong Xu, Yuqing Lin, Fuji Zhang

Publication date 6 December 2017

Full work available at URL http://ajc.maths.uq.edu.au/pdf/69/ajc_v69_p306.pdf

zbMATH Keywords

Clar coverClar number

Mathematics Subject Classification ID

Polyominoes (05B50)

Recommendations

• A maximum resonant set of polyomino graphs
• Maximum forcing number of hexagonal systems
• Forcing and anti-forcing polynomials of a type of polyomino graphs
• A minimax result for perfect matchings of a polyomino graph
• The forcing number of toroidal polyhexes

Cited in

(7)

• Some tight bounds on the minimum and maximum forcing numbers of graphs
• A maximum resonant set of polyomino graphs
• A minimax result for perfect matchings of a polyomino graph
• Maximizing the minimum and maximum forcing numbers of perfect matchings of graphs
• The polyomino graphs whose resonance graphs have a 1-degree vertex
• Some novel minimax results for perfect matchings of polyomino graphs
• Forcing, anti-forcing, global forcing and complete forcing on perfect matchings of graphs -- a survey

This page was built for publication: The maximum forcing number of a polyomino

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4595660)