Defective choosability of graphs with no edge‐plus‐independent‐set minor
Douglas R. Woodall · Journal of Graph Theory · 2003
Abstract It is proved that, if s ≥ 2, a graph that does not have K2 + Ks = 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