Glk
Новая страница: «'''Honest graph''' --- честный граф. A graph <math>G</math> is called '''honest''' if its ''edge-integrity'' is the maximum possible; that is, equal to …»
16:34
+324