Glk
Новая страница: «'''Girth''' --- обхват. The '''girth''' <math>g(G)</math> of the graph <math>G</math> is the length of its shortest cycle. The '''girth''' is 1 iff <math…»
13:05
+236
