论文信息 - A note on 3-choosability of planar graphs

A note on 3-choosability of planar graphs

In this note, we prove that a planar graph is 3-choosable if it contains neither cycles of length 4, 7, and 9 nor 6-cycle with one chord. In particular, every planar graph without cycles of length 4, 6, 7, or 9 is 3-choosable. Together with other known parallel results, this completes a theorem on 3-choosability of planar graphs: planar graphs without cycles of length 4, i, j, 9 with i

Yingqian Wang | Ming Chen | Huajing Lu

[1] Yingqian Wang,et al. A sufficient condition for a planar graph to be 3-choosable , 2007, Inf. Process. Lett..

[2] Carsten Thomassen,et al. Every Planar Graph Is 5-Choosable , 1994, J. Comb. Theory B.

[3] André Raspaud,et al. Bordeaux 3-color conjecture and 3-choosability , 2006, Discret. Math..

[4] Oleg V. Borodin,et al. Structural properties of plane graphs without adjacent triangles and an application to 3-colorings , 1996, J. Graph Theory.

[5] Margit Voigt. A non-3-choosable planar graph without cycles of length 4 and 5 , 2007, Discret. Math..

[6] Mickaël Montassier. A note on the not 3-choosability of some families of planar graphs , 2006, Inf. Process. Lett..

[7] Li Zhang,et al. A note on 3-choosability of planar graphs without certain cycles , 2005, Discret. Math..

[8] Shai Gutner,et al. The complexity of planar graph choosability , 1996, Discret. Math..

[9] André Raspaud,et al. Planar graphs without cycles of length from 4 to 7 are 3-colorable , 2005, J. Comb. Theory, Ser. B.

[10] Margit Voigt. List colourings of planar graphs , 2006, Discret. Math..

[11] Margit Voigt,et al. A not 3-choosable planar graph without 3-cycles , 1995, Discret. Math..