We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
In this note we provide an improved upper bound on the biplanar crossing number of the 8-dimensional hypercube. The k-planar crossing number of a graph cr k ( G) is the number of crossings required when every edge of G must be drawn in one of k distinct planes. It was shown in [2] that cr 2 ( Q 8 ) ≤ 256 which we improve to cr 2 ( Q 8 ) ≤ 128. Our approach highlights the relationship between symmetric drawings and the study of k-planar crossing numbers. We conclude with several open questions concerning this relationship
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.