Seven criteria for integer sequences being graphic

J.A. Hoogeveen, G. Sierksma

Research output: Contribution to journalArticleAcademicpeer-review

72 Citations (Scopus)

Abstract

Seven criteria for integer sequences being graphic are listed. Being graphic means that there is a simple graph with the given integer sequence as degree sequence. One of the criteria leads to a new and constructive proof of the well-known criterion of Erdös-Gallai.
Original languageEnglish
Pages (from-to)223-231
JournalJournal of Graph Theory
Volume15
Issue number2
DOIs
Publication statusPublished - 1991

Fingerprint

Dive into the research topics of 'Seven criteria for integer sequences being graphic'. Together they form a unique fingerprint.

Cite this