Defective choosability of graphs with no edge‐plus‐independent‐set minor
- 15 December 2003
- journal article
- Published by Wiley in Journal of Graph Theory
- Vol. 45 (1) , 51-56
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, 2004Keywords
This publication has 3 references indexed in Scilit:
- List colourings of graphs2001
- The complexity of planar graph choosabilityDiscrete Mathematics, 1996
- List colourings of planar graphsDiscrete Mathematics, 1993