4194
правки
Glk (обсуждение | вклад) Нет описания правки |
KEV (обсуждение | вклад) Нет описания правки |
||
Строка 1: | Строка 1: | ||
То же, что [[Граф блоков]]. | |||
A graph <math>G</math> is a '''block graph''' if <math>G</math> is connected and every maximal 2-connected | A graph <math>G</math> is a '''block graph''' if <math>G</math> is connected and every maximal 2-connected | ||
subgraph (i.e., a ''block'') is complete (i.e., a ''clique''. Another name is | subgraph (i.e., a ''block'') is complete (i.e., a ''clique''. Another name is | ||
'''completed Husimi tree'''. | '''completed Husimi tree'''. | ||
[[Категория:Неориентированные графы]] |