Reduced Criteria for Degree Sequences

  title={Reduced Criteria for Degree Sequences},
  author={Jeffrey W. Miller},
  journal={Discrete Mathematics},
For many types of graphs, criteria have been discovered that give necessary and sufficient conditions for an integer sequence to be the degree sequence of such a graph. These criteria tend to take the form of a set of inequalities, and in the case of the Erdős-Gallai criterion (for simple undirected graphs) and the Gale-Ryser criterion (for bipartite graphs), it has been shown that the number of inequalities that must be checked can be reduced significantly. We show that similar reductions hold… CONTINUE READING

From This Paper

Topics from this paper.
3 Citations
25 References
Similar Papers


Publications referenced by this paper.
Showing 1-10 of 25 references

Properties of a class of (0,1)-matrices covering a given matrix

  • R. P. Anstee
  • Canadian Journal of Mathematics
  • 1982
Highly Influential
10 Excerpts

Graphes et hypergraphes

  • C. Berge
  • Dunod, Paris
  • 1970
Highly Influential
8 Excerpts

Graphs with given degree of vertices

  • P. Erdős, T. Gallai
  • Mat. Lapok [Hungarian] 11
  • 1960
Highly Influential
11 Excerpts

Zero-one matrices with zero trace

  • D. R. Fulkerson
  • Pacific Journal of Mathematics 10
  • 1960
Highly Influential
8 Excerpts

On dominance relations and the structure of animal societies: III The condition for a score structure

  • H. G. Landau
  • Bulletin of Mathematical Biophysics 15
  • 1953
Highly Influential
7 Excerpts

A simple proof of the Gale-Ryser theorem

  • M. Krause
  • The American Mathematical Monthly 103
  • 1996
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…