Krausz partition of a graph

Krausz partition of a graph --- разбиение Крауса графа, Краусово разбиение графа.

A Krausz partition of [math]\displaystyle{ G }[/math] is a partition of the edge set [math]\displaystyle{ E(G) }[/math] into complete subgraphs (that are also called the clusters of the partition). The number of clusters containing a vertex [math]\displaystyle{ v }[/math] is called the order of [math]\displaystyle{ v }[/math] (in the Krausz partition). The order of the partition is the maximum order over all vertices of [math]\displaystyle{ G }[/math]. The Krausz dimension of [math]\displaystyle{ G }[/math] is defined as the minimum partition order over all Krausz partition of [math]\displaystyle{ G }[/math].