Chordless cycle

Материал из WikiGrapp
Перейти к:навигация, поиск

Chordless cycleцикл без хорд.

A cycle such that two vertices of a cycle in G are adjacent if and only if the incident edge is also in the cycle. A c.c. with three vertices is called a triangle and a chordless cycle with four vertices is called a square.

Литература

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