Queue-Number of Planar Graphs

A queue layout consists of a total order of the vertices and a partition of the edges into queues, with no two independent edges in one queue nested in the order. Determine whether there is a constant $k$ such that every planar graph has a $k$-queue layout.