Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable

Authors:
Yingqian Wang;Qian Wu;Liang Shen
Affiliations:
-;-;-
Venue:
Discrete Applied Mathematics
Year:
2011

Citing 6
Cited 0

List colourings of planar graphs

Discrete Mathematics
Every planar graph is 5-choosable

Journal of Combinatorial Theory Series B
3-list-coloring planar graphs of girth 5

Journal of Combinatorial Theory Series B
A note on the not 3-choosability of some families of planar graphs

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

Information Processing Letters
A note on 3-choosability of planar graphs

Information Processing Letters

Quantified Score

Hi-index	0.04

Visualization

Abstract

It is known that planar graphs without cycles of length 4, i, j, or 9 with 4