Новая страница: «'''Flower''' --- цветок. A '''flower''' <math>F</math> is a connected graph of order 8 which contains a cut-vertex <math>w</math> such that each component of…»
(Новая страница: «'''Flower''' --- цветок. A '''flower''' <math>F</math> is a connected graph of order 8 which contains a cut-vertex <math>w</math> such that each component of…»)