Seven criteria for integer sequences being graphic

J.A. Hoogeveen, G. Sierksma

Research output: Contribution to journalArticleAcademicpeer-review

55 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

Integer Sequences
Degree Sequence
Simple Graph
Graphics

Cite this

Hoogeveen, J.A. ; Sierksma, G. / Seven criteria for integer sequences being graphic. In: Journal of Graph Theory. 1991 ; Vol. 15, No. 2. pp. 223-231.
@article{b69ba847fb71471099cdc6a657457cf4,
title = "Seven criteria for integer sequences being graphic",
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{\"o}s-Gallai.",
author = "J.A. Hoogeveen and G. Sierksma",
year = "1991",
doi = "10.1002/jgt.3190150209",
language = "English",
volume = "15",
pages = "223--231",
journal = "Journal of Graph Theory",
issn = "0364-9024",
publisher = "Wiley-Liss Inc.",
number = "2",

}

Seven criteria for integer sequences being graphic. / Hoogeveen, J.A.; Sierksma, G.

In: Journal of Graph Theory, Vol. 15, No. 2, 1991, p. 223-231.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

T1 - Seven criteria for integer sequences being graphic

AU - Hoogeveen, J.A.

AU - Sierksma, G.

PY - 1991

Y1 - 1991

N2 - 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.

AB - 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.

U2 - 10.1002/jgt.3190150209

DO - 10.1002/jgt.3190150209

M3 - Article

VL - 15

SP - 223

EP - 231

JO - Journal of Graph Theory

JF - Journal of Graph Theory

SN - 0364-9024

IS - 2

ER -