Graphic sequences with unique realization

Journal of Combinatorial Theory, Series B - Tập 19 - Trang 42-68 - 1975
Shuo-Yen R Li1
1Department of Mathematics, University of California, Berkeley, California 94720, USA

Tài liệu tham khảo

Berge, 1973, 115 Chen, 1971, 430 Erdös, 1960, Graphs with prescribed degrees of vertices (Hungarian), Mat. Lapok, 11, 264 Hakimi, 1962, On realizability of a set of integers as degrees of the vertices of a linear graph, SIAM J. Appl. Math., 10, 496, 10.1137/0110037 Hakimi, 1963, On realizability of a set of integers as degrees of the vertices of a linear graph, SIAM J. Appl. Math., 11, 135, 10.1137/0111010 Havel, 1955, A remark on the existence of finite graphs (Hungarian), Časopis Pěst. Mat., 80, 477, 10.21136/CPM.1955.108220 Koren, 1973, Extreme degree sequences of simple graphs, J. Combinatorial Theory, Ser. B, 15, 213, 10.1016/0095-8956(73)90037-3 Pathasarathy, 1968, Enumeration of graphs with given partition, Canad. J. Math., 20, 40, 10.4153/CJM-1968-005-0