1. Graphs and Hypergraphs;Berge,1973
2. The strongest monotone degree condition for n-connectedness of a graph;Boesh;J. Combin. Theory Ser. B.,1974
3. Properties of graphs with constraints on degrees;Bondy;Studia Sci. Math. Hungar.,1969
4. Graphic sequences and graphic polynomials, a report;Eggleton;Infinite and Finite Sets, Colloq. Math. Soc. János Bolyai,1973
5. C.St.J.A. Nash-Williams, Valency sequences which force graphs to have hamiltonian circuits: Interim report, University of Waterloo, Waterloo, Canada.