A Condition for Realizability of a Sequence by a Hamiltonian Graph.
Abstract
Erdos and Gallai characterized in a previous paper (1960) the sequences of integers which are realizable by (i.e., to be the degree sequence of) a simple graph. In this paper the author gives a constructive proof to their theorem and uses this method of proof to obtain a sufficient condition for a sequence to be realizable by a Hamiltonian graph. (Modified author abstract)
Document Details
- Document Type
- Technical Report
- Publication Date
- Nov 01, 1973
- Accession Number
- AD0774970
Entities
People
- Michael Koren
Organizations
- Cornell University