История
Перейти к навигации
Перейти к поиску
21 ноября 2024
нет описания правки
+27
нет описания правки
+134
Новая страница: «'''Сluster graph''' (''кластерный граф'') is a graph formed from the disjoint union of complete graphs (or cliques). Equivalently, a graph is a cluster graph if and only if it has no '''three-vertex induced path''' (i.e. three-vertex path as an induced subgraph) '''''P''<sub>3</sub>'''; for this reason, the cluster graphs are also called '''''P''<su...»
+655