Defective choosability of graphs with no edge-plus-independent-set minor

  • Authors:

  • Douglas R. Woodall

  • Affiliations:

  • School of Mathematical Sciences, University of Nottingham, Nottingham, NG7 2RD, England

  • Venue:
  • Journal of Graph Theory
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

It is proved that, if s ≥ 2, a graph that does not have K2 +  $\overline{K}$s = K1 + K1, 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