Channel Assignment and Improper Choosability of Graphs

1. Appel, K., Haken, W.: Every planar map is four colourable, Part I: Discharging. Illinois J. Math. 21, 429–490 (1977)

   MATH  MathSciNet  Google Scholar 

2. Appel, K., Haken, W., Koch, J.: Every planar map is four colourable, Part II: Reducibility. Illinois J. Math. 21, 491–567 (1977)

   MATH  MathSciNet  Google Scholar 

3. Eaton, N., Hull, T.: Defective list colorings of planar graphs. Bull. Inst. Combin. Appl. 25, 79–87 (1999)

   MATH  MathSciNet  Google Scholar 

4. Havet, F., Sereni, J.-S.: Improper choosability and maximum average degree. Internal Report INRIA RR-5164 (2004), ftp://ftp.inria.fr/INRIA/publication/publi-ps-gz/RR/RR-5164.ps.gz

5. Lih, K.-W., Song, Z., Wang, W., Zhang, K.: A Note on List Improper Coloring Planar Graphs. Appl. Math. Let. 14, 269–273 (2001)

   Article  MATH  MathSciNet  Google Scholar 

6. Škrekovski, R.: List improper colouring of planar graphs. Comb. Prob. Comp. 8, 293–299 (1999)

   Article  MATH  Google Scholar 

7. Škrekovski, R.: List improper colorings of planar graphs with prescribed girth. Discrete Math. 214, 221–233 (2000)

   Article  MATH  MathSciNet  Google Scholar 

8. Thomassen, C.: Every planar graph is 5-choosable. J. Comb. Theory B 62, 180–181 (1994)

   Article  MATH  MathSciNet  Google Scholar 

Download references