Clique-transversal --- кликовая трансверсаль.
A clique-transversal of a graph is a subset of vertices that meets all the cliques. A clique-independent set is a collection of pairwise vertex disjoint cliques. The clique-transversal number and clique-independence number of , denoted by and , are the sizes of a minimum clique-transversal and a maximum clique-independent set of , respectively.
It is easy to see that for any graph . A graph is clique-perfect if for every induced subgraph of . If this equality holds for the graph , we say that is clique-good.