Graph is connected exactly when it cannot be represented as a union of its two subgraphs

146 Views Asked by At

How to prove that a graph is connected exactly when it cannot be represented as a union of its two subgraphs?

According to one of the definitions, a graph is connected if it cannot be represented as a union of two graphs, and disconnected otherwise. Why is this so, and how can it be formally proven?