Glk
Новая страница: «'''Superconnected graph''' --- суперсвязный граф. A graph <math>G</math> is said to be ''' superconnected''' if, for every minimum vertex cut (cut …»
14:15
+301