Choosability of the square of planar subcubic graphs with large girth

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.