Bicritical graph

Материал из WikiGrapp
Перейти к:навигация, поиск

Bicritical graphбикритический граф.

A finite, undirected, connected and simple graph \,G is said to be bicritical if \,G - u - v has a perfect matching for each pair of vertices u and v in \,G such that u \neq v.

Bicritical graphs play a central role in the decomposition theory of graphs in terms of their maximum matchings.


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