an:05566748
Zbl 1213.05084
Havet, F.
Choosability of the square of planar subcubic graphs with large girth
EN
Discrete Math. 309, No. 11, 3553-3563 (2009).
00250152
2009
j
05C15 05C10
list colouring; square of a graph; bounded density; planar graph
Summary: We show that the choice number of the square of a subcubic graph with maximum average degree less than 18/7 is at most 6. As a corollary, we get that the choice number of the square of a subcubic planar graph with girth at least 9 is at most 6. We then show that the choice number of the square of a subcubic planar graph with girth at least 13 is at most 5.