Chromatic numbers of layered graphs with bounded maximal clique

A graph is called $n$-layered if the set of its vertices is a union of pairwise nonintersected $n$-cliques. We estimate chromatic numbers of $n$-layered graphs without $(n+1)$-cliques. Bibl. 10 titles.