1. A min–max theorem for plane bipartite graphs;Abeledo;Discrete Appl. Math.,2010
2. On the forced matching numbers of bipartite graphs;Adams;Discrete Math.,2004
3. A linear-time algorithm for computing the complete forcing number and the Clar number of catacondensed hexagonal systems;Chan;MATCH Commun. Math. Comput. Chem.,2015
4. Global forcing number of benzenoid graphs;Došlić;J. Math. Chem.,2007
5. Leapfrog transformations and polyhedra of clar type;Fowler;J. Chem. Soc. Faraday Trans.,1994