  The book embedding of a graph $G$ is to place the vertices of $G$ on the
spine and draw the edges to the pages so that the edges in the same page do not
cross with each other. A book embedding is matching if the vertices in the same
page have maximum degree at most 1. The matching book thickness is the minimum
number of pages in which a graph can be matching book embedded. A graph $G$ is
dispersable if and only if $mbt(G)=\Delta(G)$. In this paper, we prove that
bipartite cubic planar graphs are dispersable.
