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

Материал из WEGA
Перейти к навигации Перейти к поиску
(Новая страница: «'''Cocomparability graph''' --- граф косравнимости. Graph which is the ''complement'' of a ''comparability graph'' is called a '''cocomparability …»)
 
Нет описания правки
 
Строка 1: Строка 1:
'''Cocomparability graph''' --- граф косравнимости.  
'''Cocomparability graph''' — ''[[граф косравнимости]].''


Graph which is the ''complement'' of a ''comparability graph''
[[graph, undirected graph, nonoriented graph|Graph]] which is the ''[[complement of a graph, complementary graph|complement]]'' of a ''[[comparability graph]]'' is called a '''cocomparability graph'''.
is called a '''cocomparability graph'''.


The class of cocomparability
The class of cocomparability graphs consists of ''[[perfect graph|perfect graphs]]'' and contains the property set of all ''[[cograph|cographs]], [[permutation graph|permutation graphs]]'' and ''[[interval graph|interval graphs]]''
graphs consists of ''perfect graphs'' and contains the property set of
 
all ''cographs, permutation graphs'' and ''interval graphs''
==Литература==
 
* Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.

Текущая версия от 10:47, 24 октября 2018

Cocomparability graphграф косравнимости.

Graph which is the complement of a comparability graph is called a cocomparability graph.

The class of cocomparability graphs consists of perfect graphs and contains the property set of all cographs, permutation graphs and interval graphs

Литература

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