Новая страница: «'''Arrangeable graph''' --- аранжируемый граф. A ''cf-graph''is called '''arrangeable''' if its ''arrangement''exists and '''nonarrangeable''' other…»
(Новая страница: «'''Arrangeable graph''' --- аранжируемый граф. A ''cf-graph''is called '''arrangeable''' if its ''arrangement''exists and '''nonarrangeable''' other…»)