✦ LIBER ✦
Defective choosability of graphs with no edge-plus-independent-set minor
✍ Scribed by Douglas R. Woodall
- Publisher
- John Wiley and Sons
- Year
- 2003
- Tongue
- English
- Weight
- 76 KB
- Volume
- 45
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
It is proved that, if s ≥ 2, a graph that does not have K~2~ + K~s~ = K~1~ + K~1, s~ as a minor is (s, 1)*‐choosable. This completes the proof that such a graph is (s + 1 − d,d)*‐choosable whenever 0 ≤ d ≤ s −1 © 2003 Wiley Periodicals, Inc. J Graph Theory 45: 51–56, 2004