Weak clique-covering cycle
Материал из WEGA
Weak clique-covering cycle --- слабо кликово-покрывающий цикл.
A cycle of a graph [math]\displaystyle{ C }[/math] is called weak clique-covering, if each component of [math]\displaystyle{ G-V(C) }[/math] is a clique.
