Adjective
biconnected (not comparable) (graph theory) Describing a connected graph from which two vertices must be removed for it to become disconnected.