Planar graphs have two-coloring number at most 8

We prove that the two-colouring number of any planar graph is at most 8. This resolves a question of Kierstead et al. [SIAM J. Discrete Math.~23 (2009), 1548–1560]. The result is optimal.