A subset M ⊆ E of edges of a graph G = (V, E) is called a matching in G if no two edges in M share a common vertex. A matching M in G is called an induced matching if G[M], the subgraph of G induced by M, is the same as ...