On the Pagenumber of the Cube-Connected Cycles
- 55 Downloads
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.
KeywordsCube-connected cycles Book embedding
Mathematics Subject Classification (2000)68R10
Unable to display preview. Download preview PDF.
- 1.Chartrand G., Lesniak L.: Graphs & Digraphs, 4 edn. Chapman & Hall/CRC, Boca Raton (2004)Google Scholar
- 3.Dujmović V., Wood D.R.: Stacks, queues and tracks: layouts of graph subdivisions. Discret. Math. Theor. Comput. Sci. 7, 155–202 (2005)Google Scholar
- 5.Konoe, M., Hagiwara, K. Tokura, N.: On the pagenumber of hypercubes and cube-connected cycles. IEICE Trans. J71-D(3), 490–500 (1988) (in Japanese)Google Scholar
- 9.Yannakakis, M.: Four pages are necessary and sufficient for planar graphs. In: Proceedings of 18th ACM symposium on theory of computing, pp.104–108 (1986)Google Scholar