BIT Numerical Mathematics

, Volume 33, Issue 2, pp 232–237

On crossing numbers of hypercubes and cube connected cycles

  • Ondrej Sýkora
  • Imrich Vrťo
Part I Computer Science

Abstract

We prove tight bounds for crossing numbers of hypercube and cube connected cycles (CCC) graphs.

CR Categories

F.1.2 G.2.2 

Key Words

crossing number cube connected cycles hypercube lower bound 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© BIT Foundation 1993

Authors and Affiliations

  • Ondrej Sýkora
    • 1
  • Imrich Vrťo
    • 1
  1. 1.Institute for InformaticsSlovak Academy of SciencesBratislavaCzecho-Slovakia

Personalised recommendations