On crossing numbers of hypercubes and cube connected cycles
Part I Computer Science
We prove tight bounds for crossing numbers of hypercube and cube connected cycles (CCC) graphs.
CR CategoriesF.1.2 G.2.2
Key Wordscrossing number cube connected cycles hypercube lower bound
Unable to display preview. Download preview PDF.
© BIT Foundation 1993