Circular-arc graph: различия между версиями

'''Circular-arc graph''' — ''[[граф дуг окружности]].''

A '''circular-arc graph''' is the [[intersection graph]] of a family of [[arc|arcs]] on a

circle; that is, for each [[vertex]] <math>\,v_{i}</math> there is a (closed)

arc <math>\,a_{i}</math> of the circle such that <math>\,v_{i}</math> and <math>\,v_{j}</math> are [[adjacent vertices|adjacent]] if and only if <math>a_{i} \cap a_{j} \neq \emptyset</math>.

 

 

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