H-Covering, H-Covering set

[math]\displaystyle{ \,H }[/math]-Covering, [math]\displaystyle{ \,H }[/math]-Covering set — [math]\displaystyle{ \,H }[/math]-покрытие.

Let [math]\displaystyle{ \,H }[/math] and [math]\displaystyle{ \,F }[/math] be two hypergraphs on the same vertex set. A subset [math]\displaystyle{ \,C }[/math] of [math]\displaystyle{ \,F }[/math] is said to be [math]\displaystyle{ \,H }[/math]-covering if every edge in [math]\displaystyle{ \,H }[/math] meets some edge from [math]\displaystyle{ \,C }[/math] (in other words, the union of [math]\displaystyle{ \,C }[/math] is a vertex cover for [math]\displaystyle{ \,H }[/math]).

Литература

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