Accession Number : AD0774970

Title :   A Condition for Realizability of a Sequence by a Hamiltonian Graph.

Descriptive Note : Technical rept.,

Corporate Author : CORNELL UNIV ITHACA N Y DEPT OF OPERATIONS RESEARCH

Personal Author(s) : Koren,Michael

Report Date : NOV 1973

Pagination or Media Count : 12

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)

Descriptors :   *Graphs, Network flows, Sequences(Mathematics), Theorems

Subject Categories : Numerical Mathematics
      Operations Research

Distribution Statement : APPROVED FOR PUBLIC RELEASE