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