Elsevier

Information Processing Letters

Volume 104, Issue 4, 15 November 2007, Pages 146-151
Information Processing Letters

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

https://doi.org/10.1016/j.ipl.2007.06.005Get rights and content

Abstract

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

References (9)

There are more references available in the full text version of this article.

Cited by (0)

1

Supported by NNSFC Grant No. 10471131.

View full text
Copyright © 2007 Elsevier B.V. All rights reserved.