Conjecture on dispersability of bipartite cubic planar graphs

Let $G$ be a bipartite cubic planar graph, meaning that $G$ is bipartite, planar, and every vertex has degree three. A graph is dispersable if it has a proper $\Delta(G)$-edge-colouring and a $\Delta(G)$-page book embedding in which all edges of one colour lie on the same page, where $\Delta(G)$ is the maximum degree of $G$. Dispersability conjecture for bipartite cubic planar graphs. All bipartite cubic planar graphs, including those that are not 3-connected, are dispersable. The source notes that 3-connected bipartite cubic planar graphs are dispersable; the conjecture concerns the remaining cases and its resolution is not specified here.