Publications and Research

Document Type

Article

Publication Date

3-25-2009

Abstract

We find a.nd prove the maximum rectilinear crossing n1.1mber of the three-dimensional cube graph (Q3). We demonstrate a method of drawing then-cube graph, Qn., with many crossings, and thus find a lower bound for the maximum rectilinear crossing number of Qn. We conjecture that this bound is sharp. We also prove an upper bound for the maximum rectilinear crossing number of Qn.

Comments

This work was originally published in Congressus Numerantium.

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.