1294
правки
Chordless cycle: различия между версиями
Материал из WEGA
нет описания правки
Glk (обсуждение | вклад) (Новая страница: «'''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…») |
KVN (обсуждение | вклад) Нет описания правки |
||
| Строка 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 | vertices is called a ''[[triangle]]'' and a '''chordless cycle''' with four | ||
vertices is | vertices is called a ''[[square]]''. | ||
==Литература== | |||
* Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009. | |||
