A sufficient condition for a planar graph to be 3-choosable

  • Authors:

  • Liang Shen;Yingqian Wang

  • 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

  • Venue:
  • Information Processing Letters
  • Year:
  • 2007

Quantified Score

Hi-index 0.89

Visualization

Abstract

It is shown that a planar graph without cycles of length 4, 6, 8, or 9 is 3-choosable.