Let $G = (V, E)$ be a bipartite graph. Say $V'$ induces a $k$-matching if $G[V']$ has $2k$ vertices and $k$ edges such that every connected component contains two vertices. Does a graph $G$ wich contains an induced $k$-matching have a special name?
I am looking for any known necessary/sufficient conditions for such a graph.