Covers and strong covers in directed bipartite graphs
K. Vidyasankar · Journal of Graph Theory · 1980
Abstract Let G be a finite graph with directed bipartition (V+, V−). Necessary and sufficient conditions are given for the existence of covers and strong covers that: (i) satisfy matching with respect to V+, and (ii) include a given set of edges that satisfies matching with respect to V+.