Also known as 2-connected graph, 2-vertex-connected graph, nonseparable graph, non-separable graph
graph on at least 3 vertices that remains connected when any one vertex is removed
Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).