Pairs of sequences with a unique realization by bipartite graphs
暂无分享,去创建一个
Pairs of sequences which have a unique realization by bipartite graphs (up to isomorphism) are characterized.
[1] S. Hakimi. On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I , 1962 .
[2] Daniel J. Kleitman,et al. Algorithms for constructing graphs and digraphs with given valences and factors , 1973, Discret. Math..
[3] D. Gale. A theorem on flows in networks , 1957 .