✦ LIBER ✦
Graph decompositions without isolated vertices III
✍ Scribed by Enomoto, Hikoe; Matsunaga, Shinsuke
- Publisher
- John Wiley and Sons
- Year
- 1997
- Tongue
- English
- Weight
- 135 KB
- Volume
- 24
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
✦ Synopsis
Let G be a graph of order n, and n = k i=1 a i be a partition of n with a i ≥ 2. In this article we show that if the minimum degree of G is at least 3k -2, then for any distinct
and ``the subgraph induced by A i contains no isolated vertices'' for all i, 1 ≤ i ≤ k. Here, the bound on the minimum degree is sharp.