Block graph

То же, что Граф блоков.

A graph [math]\displaystyle{ G }[/math] is a block graph if [math]\displaystyle{ G }[/math] is connected and every maximal 2-connected subgraph (i.e., a block) is complete (i.e., a clique. Another name is completed Husimi tree.