Degree Sequences of Graphs and Dominance Order

Journal of Graph Theory

Volumn 22, Issue 1, 1996, Pages 89-93

  Triesch, Eberhard ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030542992     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0118(199605)22:1<89::AID-JGT12>3.0.CO;2-J     Document Type: Article

References (7)

1. M. Aigner, Uses of the diagram lattice, Mitteil. Mathem. Seminar Giessen Heft 163 Coxester-Fest-schrift (1984), 61-77.
2. P. Erdös and T. Gallai, Graphs with prescribed degrees of vertices (Hungarian), Math. Lapok 11 (1960), 264-274.
3. O. Favaron, M. Mahéo, and J.-F. Saclé, On the residue of a graph, J. Graph Theory 15 (1991), 39-64.
4. D. R. Fulkerson and H.J. Ryser, Multiplicities and minimal widths for (0, 1)-matricies, Canad. J. Math. 14 (1962), 498-508.
5. S. Hakimi, On the realizability of a set of integers as degree sequences of the vertices of a graph, J. SIAM Appl. Math. 10 (1962), 496-506.
6. V. Havel, A remark on the existence of finite graphs (Hungarian), Časopis Pěst Mat. 80 (1955), 477-480.
7. E. Ruch and I. Gutman, The branching extent or graphs, J. Comb., Information and System Sci. 4 (1979), 285-295.