Question: graph - How to find maximum induced subgraph H of G such that each vertex in H has degree ≥ k