K-Cover of a (hyper)graph

$\,k$-Cover of a (hyper)graph — $\,k$-покрытие (вершинное) графа (гиперграфа).

This is a collection of points such that each edge contains at least $\,k$ of them. $\,1$-cover is simply a vertex (point) cover. A $\,k$-cover can also be regarded as a mapping $t: \; V(G) \rightarrow \{0, 1, \ldots\}$ such that $\sum_{x \in E} t(x) \geq k$ for each edge $\,E$.

Литература

• Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.