Hostname: page-component-586b7cd67f-gb8f7 Total loading time: 0 Render date: 2024-11-22T06:59:53.028Z Has data issue: false hasContentIssue false
  • English
  • Français

A Note on Degree Sequences of Graphs

Published online by Cambridge University Press:  20 November 2018

Richard A. Brualdi
Richard A. Brualdi*
Affiliation:
Department of Mathematics, University of Wisconsin, Van Vleck Hall Madison-Wisconsin 53706
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Sufficient conditions for a sequence of numbers to be the degree sequence of a graph are derived from the Erdos-Gallai theorem on degree sequences of graphs.

Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 23 , Issue 1 , 01 March 1980 , pp. 21 - 27
Copyright
Copyright © Canadian Mathematical Society 1980

References

1. Berge, C., Graphs and Hypergraphs, North Holland (Amsterdam), 1973.Google Scholar
2. Harary, F., Graph Theory, Addison-Wesley (Reading, Mass.), 1969.Google Scholar
3. Kundu, S., The k-factor conjecture is true, Discrete Math. 6 (1973), 367-376.Google Scholar
4. Lovász, L., Valencies of graphs with 1-factors, Periodica Math. Hungarica 5 (2) (1974), 149-151.Google Scholar