Просмотр кода страницы Block-cutvertex tree, block-cutpoint graph

'''Block-cutvertex tree, block-cutpoint graph''' — ''[[дерево блоков и точек сочленения|дерево (граф) блоков и точек сочленения]].'' 

The '''block-cutvertex tree''' of a [[connected graph]] <math>G</math> has a [[N-node|<math>B</math>-node]] for each [[block]]
([[biconnected component]]) of <math>G</math>, and a <math>C</math>-node for each ''[[cutvertex]]'' of <math>G</math>. There is an [[edge]] between a <math>C</math>-node <math>u</math> and a
<math>B</math>-node <math>b</math> if and only if <math>u</math> belongs to the corresponding block of
<math>b</math> in <math>G</math>. The '''block-cutvertex tree''' can be constructed in linear time.

==Литература==

* Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.