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
The question was posed to me during an online interview.
My question comes from Trees in division Trees of Discrete Mathematics