Новая страница: «'''Cactus''' --- кактус, дерево Хусими. A graph <math>G</math> is a '''сactus''' if every its edge is a part of at most one cycle in <math>G</ma…»
(Новая страница: «'''Cactus''' --- кактус, дерево Хусими. A graph <math>G</math> is a '''сactus''' if every its edge is a part of at most one cycle in <math>G</ma…»)