1. P. Adans, M. Mahdian, E. Mahmoodian, On the forced matching number of bipartite graphs. Discrete Math. 281, 1–12 (2004)
2. P. Afshani, H. Hatami, E. Mahmoodian, On the spectrum of the forced matching number of graphs. Australas. J. Combin. 30, 147–160 (2004)
3. G. Chartrand, F. Harary, M. Schultz, C. Wall, Forced orientation numbers of a graph. in Proceedings of the Twenty-fifth Southeastern International Conference on Combinatorics, Graph Theory and Computing (Boca Raton, FL, 1994), 100:183–191
4. G. Chartrand, H. Gavlas, R. Vandell, F. Harary, The forcing domination number of a graph. J. Comb. Math. Comb. Comput. 25, 161–174 (1997)
5. G. Chartrand, P. Zhang, The forcing geodetic nuber of a graph. Discuss. Math. Graph Theory 19, 45–58 (1999)