What is a separable graph?

• A. A disconnected graph by deleting a vertex
• B. A disconnected graph by removing an edge
• C. A disconnected graph by removing one edge and a vertex
• D. A simple graph which does not contain a cycle