Аноним

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

Материал из WikiGrapp
нет описания правки
(Новая страница: «'''Berge graph''' --- граф Бержа. '''1.''' See '' Hole''. '''2.''' A graph for which ''Berge's conjecture'' is fulfilled is called a '''Berge graph'''; c…»)
 
Нет описания правки
 
Строка 1: Строка 1:
'''Berge graph''' --- граф Бержа.  
'''Berge graph''' — ''[[граф Бержа]].''


'''1.''' See '' Hole''.
'''1.''' See ''[[Hole]]''.


'''2.''' A graph for which ''Berge's conjecture'' is fulfilled is called a '''Berge graph''';
'''2.''' A [[graph, undirected graph, nonoriented graph|graph]] for which ''[[Berge's conjecture]]'' is fulfilled is called a '''Berge graph''';
clearly, each Berge graph is ''perfect''
clearly, each Berge graph is ''[[perfect graph|perfect]]''
 
==Литература==
 
* Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.