Krausz dimension and its generalizations in special graph classes

Olga Glebova, Yury Metelsky, Pavel Skums

A {\it krausz $(k,m)$-partition} of a graph $G$ is the partition of $G$ into cliques, such that any vertex belongs to at most $k$ cliques and any two cliques have at most $m$ verti…