✦ LIBER ✦

Extreme degree sequences of simple graphs

✍ Scribed by Michael Koren

Publisher: Elsevier Science
Year: 1973
Tongue: English
Weight: 501 KB
Volume: 15
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(73)90037-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Signed degree sequences of signed graphs

✍ Yan, Jing-Ho; Lih, Ko-Wei; Kuo, David; Chang, Gerard J. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 105 KB 👁 2 views

sequence to be the signed degree sequence of a signed graph or a signed tree, answering a question raised by

Extreme degrees in random graphs

✍ Zbigniew Palka 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 448 KB

Degree sequences in triangle-free graphs

✍ Paul Erdős; Siemion Fajtlowicz; William Staton 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 250 KB

Degree sequences of graphs and dominance

Degree sequences of graphs and dominance order

✍ Triesch, Eberhard 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 271 KB 👁 2 views

Suppose that the graphical partition H(A) = (a: 2 . . . 2 a:) arises from A = (al 2 . . . 2 a,) by deleting the largest summand a1 from A and reducing the a1 largest of the remaining summands by one. Let (a;+l 2 . . 2 ah) = H ( A ) denote the partition obtained by applying the operator H i times. We

The degree sequences of self-complementa

The degree sequences of self-complementary graphs

✍ C.R.J Clapham; D.J Kleitman 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 418 KB

Graph Decompositions Satisfying Extremal

Graph Decompositions Satisfying Extremal Degree Constraints

✍ Paul A. Catlin 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 175 KB

## Abstract We show that the vertex set of any graph __G__ with __p__⩾2 vertices can be partitioned into non‐empty sets __V__~1~, __V__~2~, such that the maximum degree of the induced subgraph 〈__V__~i~〉 does not exceed where p^i^ = |__V__^i^|, for __i__=1, 2. Furthermore, the structure of the in