Glk
Новая страница: «'''Supereulerian graph''' --- суперэйлеров граф. A graph is ''' supereulerian''' if it has a spanning eulerian subgraph (a spanning closed trail).»
14:16
+164