On the spectrum of matching forcing numbers for bipartite graphs
Hongwei Wang · Journal of Shandong University · 2009
The trailing-vertex method in essence is improved,a necessary condition for the forcing number of perfect matching equals to a given natural number k for a bipartite graph is obtained,and a necessary and sufficient condition for the minimum forcing number equals the minimum number of trailing vertices of all standard orderings of a color set is given.