Аноним

Chordless cycle: различия между версиями

Материал из WEGA
нет описания правки
(Новая страница: «'''Chordless cycle''' --- цикл без хорд. A cycle such that two vertices of a cycle in <math>G</math> are adjacent if and only if the incident edge is al…»)
 
Нет описания правки
 
Строка 1: Строка 1:
'''Chordless cycle''' --- цикл без хорд.  
'''Chordless cycle''' — [[цикл без хорд]].  


A cycle such that two vertices of a cycle in <math>G</math> are adjacent if
A [[cycle]] such that two [[vertex|vertices]] of a cycle in <math>G</math> are adjacent if
and only if the incident edge is also in the cycle. A c.c. with three
and only if the incident [[edge]] is also in the cycle. A c.c. with three
vertices is mathcalled a ''triangle'' and a '''chordless cycle''' with four
vertices is called a ''[[triangle]]'' and a '''chordless cycle''' with four
vertices is mathcalled a ''square''.
vertices is called a ''[[square]]''.
 
==Литература==
 
* Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.