1. On the forced matching number of graphs;Adams;Discrete Math.,2004
2. On the spectrum of the forced matching number of graphs;Afshani;Australasian J. Combin.,2004
3. The size of the smallest strong critical set in a Latin square;Bate;Ars Combin.,1999
4. The forcing domination number of a graph;Chartrand;J. Combin. Math. Combin. Comput.,1997
5. G. Chartrand, F. Harary, M. Schultz, C.E. Wall, Forced orientation numbers of a graph, in: Proceedings of the 25th Southeastern International Conference on Combinatorics, Graph Theory and Computing, vol. 100, Boca Raton, FL, 1994, pp. 183–191.