✦ LIBER ✦
Sequences realizable by maximal k-degenerate graphs
✍ Scribed by M. Borowiecki; J. Ivančo; P. Mihók; G. Semanišin
- Publisher
- John Wiley and Sons
- Year
- 1995
- Tongue
- English
- Weight
- 283 KB
- Volume
- 19
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
✦ Synopsis
A graph G is called k-degenerate if every subgraph of G has a vertex of degree at most k. A k-degenerate graph G is maximal k-degenerate if for every edge e E QG), G + e is not k-degenerate. Necessary and sufficient conditions for the sequence II = (d,, d2,. . . , d,) to be a degree sequence of a maximal k-degenerate graph G are presented.