✦ LIBER ✦
Maximal matchings in graphs with large neighborhoods of independent vertices
✍ Scribed by I. Rinsma; C. H. C. Little; D. R. Woodall
- Publisher
- John Wiley and Sons
- Year
- 1990
- Tongue
- English
- Weight
- 174 KB
- Volume
- 14
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
We obtain lower bounds on the size of a maximum matching in a graph satisfying the condition |N(X)| ≥ s for every independent set X of m vertices, thus generalizing results of Faudree, Gould, Jacobson, and Schelp for the case m = 2.