Hi, all

How to find the least number of one-point-connected-subgraphs of a graph? I think we can go greedy, but how to prove greedy works?

by one-point-connected-subgraph I mean, there is at least one point that is connected to other points in the subgraph

Thanks!