Новая страница: «'''Dominant-matching graph''' --- домиинантный граф паросочетания. A graph <math>G</math> is called a '''dominant-matching graph''' if…»
(Новая страница: «'''Dominant-matching graph''' --- домиинантный граф паросочетания. A graph <math>G</math> is called a '''dominant-matching graph''' if…»)