Skip to main content
Conference Proceedings

On the crossing number of the hypercube and the cube connected cycles

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1992) 570 LNCS 214-218
DOI: 10.1007/3-540-55121-2_21
4Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We prove tight bounds for the crossing number of the n-dimensional hypercube and cube connected cycles (CCC) graphs.

Cite

CITATION STYLE

APA

Sýkora, O., & Vrťo, I. (1992). On the crossing number of the hypercube and the cube connected cycles. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 570 LNCS, pp. 214–218). Springer Verlag. https://doi.org/10.1007/3-540-55121-2_21

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free