- nonseparable graph
- мат. неразделимый [несепарабельный] граф
Большой англо-русский и русско-английский словарь. 2001.
Большой англо-русский и русско-английский словарь. 2001.
Biconnected graph — In the mathematical discipline of graph theory, a biconnected graph is a connected graph with no articulation vertices.In other words, a biconnected graph is nonseparable, meaning if any vertex were to be removed, the graph will remain… … Wikipedia