On the Pagenumber of the Cube-Connected Cycles
Cube (algebra)
DOI:
10.1007/s11786-009-0012-y
Publication Date:
2009-11-27T16:28:50Z
AUTHORS (2)
ABSTRACT
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.
SUPPLEMENTAL MATERIAL
Coming soon ....
REFERENCES (9)
CITATIONS (4)
EXTERNAL LINKS
PlumX Metrics
RECOMMENDATIONS
FAIR ASSESSMENT
Coming soon ....
JUPYTER LAB
Coming soon ....