Cyclability — цикличность.
A subset of vertices of a graph is called cyclable in if there is in some cycle containing all the vertices of . It is known that if is a -connected graph of order and if is a subset of vertices such that the degree sum of any four independent vertices of is at least , then is cyclable. Here is the number of vertices of a maximum independent set of .
- Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.