On the pagenumber of the cube-connected cycles

In this manuscript, we treat the book embedding of the cube-connected cycles. The book embedding of graphs is one of the graph layout problems and has been studied widely. We show that the pagenumber of CCC(n), n ≥ 4, is three and that of CCC(3) is two. This result is optimal since CCC(n) can not be embedded into two pages for n ≥ 4