The maximum forcing number of a polyomino

zbMATH Open1375.05052MaRDI QIDQ4595660FDOQ4595660

Mujiangshan Wang, Fuji Zhang, Liqiong Xu, Yuqing Lin

Publication date: 6 December 2017

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

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

zbMATH Keywords

Clar numberClar cover

Mathematics Subject Classification ID

Polyominoes (05B50)

Cited In (2)

• Maximizing the minimum and maximum forcing numbers of perfect matchings of graphs
• Some tight bounds on the minimum and maximum forcing numbers of graphs

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)