Последовательности степеней ребер и их реализации

Abstract

The whole characterization of graphic (multigraphic, pseudographic) integer-pair sequences, having a unique graphic (multigraphic, pseudographic) realization, is given. The theorem, showing that any graphic (multigraphic, pseudographic) realization of a given integer-pair sequence may be obtained from any known graphic (multigraphic, pseudographic) realization of this integer-pair sequence by means of 6-interchanges (m-interchanges, p-interchanges) is presented.