Length thresholds for graphic lists given fixed largest and smallest entries and bounded gaps

Discrete Mathematics

Volumn 312, Issue 9, 2012, Pages 1494-1501

  Barrus, Michael D ^a   Hartke, Stephen G ^b   Jao, Kyle F ^c   West, Douglas B ^c  

^a BLACK HILLS STATE UNIVERSITY   (United States)

^b UNIVERSITY OF NEBRASKA LINCOLN   (United States)

^c UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

AignerTriesch method; Dominance order; ErdsGallai inequalities; Graphic list; Graphic sequence; Integer partition

Indexed keywords

EID: 84857786326     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2011.05.001     Document Type: Article

References (10)

1. M. Aigner, and E. Triesch Realizability and uniqueness in graphs Discrete Math. 136 1994 103 113
2. R.B. Eggleton Graphic sequences and graphic polynomials: a report Infinite and finite sets (Colloq., Keszthely, 1973; dedicated to P. Erds on his 60th birthday) vol. 1 Colloq. Math. Soc. Janos Bolyai vol. 10 1975 North-Holland Amsterdam 385 392
3. P. Erds, and T. Gallai Graphs with prescribed degree of vertices Mat. Lapok 11 1960 264 274 (in Hungarian)
4. P.L. Hammer, T. Ibaraki, and B. Simeone Threshold sequences SIAM J. Algebr. Discrete Methods 2 1981 39 49
5. S.L. Hakimi On the realizability of a set of integers as degrees of the vertices of a graph SIAM J. Appl. Math. 10 1962 496 506
6. V. Havel A remark on the existence of finite graphs Casopis Pest. Mat. 80 1955 477 480
7. S.Y.R. Li Graphic sequences with unique realization J. Combin. Theory Ser. B 19 1975 42 68
8. A. Tripathi, and S. Vijay A note on a theorem of Erds and Gallai Discrete Math. 265 2003 417 420
9. D.B. West Exercise 1.3.57 Introduction to Graph Theory 2nd ed. 2001 Prentice-Hall p. 52
10. I.E. Zverovich, and V.E. Zverovich Contributions to the theory of graphic sequences Discrete Math. 105 1992 293 303