A note on 3-choosability of planar graphs

  • Authors:

  • Yingqian Wang;Huajing Lu;Ming Chen

  • Affiliations:

  • College of Mathematics, Physics and Information Engineering, Zhejiang Normal University, Jinhua, 321004, China;College of Mathematics, Physics and Information Engineering, Zhejiang Normal University, Jinhua, 321004, China;College of Mathematics, Physics and Information Engineering, Zhejiang Normal University, Jinhua, 321004, China

  • Venue:
  • Information Processing Letters
  • Year:
  • 2008

Quantified Score

Hi-index 0.89

Visualization

Abstract

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