Question: Prove that the following C4-Free Deletion problem is NP-complete. Instance: Graph G- (V, E) and positive integer k. Question: Does G contain S k vertices
Prove that the following C4-Free Deletion problem is NP-complete.

Instance: Graph G- (V, E) and positive integer k. Question: Does G contain S k vertices V such that G-V contains no 4-cycle as an induced subgraph? Hint: Use a reduction from VERTEX Cover by local replacement
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
