Contracting edges to destroy a pattern: A complexity study

Dipayan Chakraborty, R. B. Sandeep

Given a graph G and an integer k, the objective of the $\Pi$-Contraction problem is to check whether there exists at most k edges in G such that contracting them in G results in a gr…