论文信息 - The Same Upper Bound for Both: The 2-page and the Rectilinear Crossing Numbers of the n-Cube

The Same Upper Bound for Both: The 2-page and the Rectilinear Crossing Numbers of the n-Cube

We present two main results: a 2-page and a rectilinear drawing of the n-dimensional cube Qn. Both drawings have the same number 1257684n−2n−33(3n2+9+(−1)n+12) of crossings, even though they are given by different constructions. The first improves the current best general 2-page drawing, while the second is the first nontrivial rectilinear drawing of Qn.

Celina M. H. de Figueiredo | Imrich Vrto | Luérbio Faria | R. Bruce Richter

[1] Mihalis Yannakakis,et al. Four pages are necessary and sufficient for planar graphs , 1986, Symposium on the Theory of Computing.

[2] P. Erdös,et al. Crossing Number Problems , 1973 .

[3] Tom Madej,et al. Bounds for the crossing number of the N-cube , 1991, J. Graph Theory.

[4] Mihalis Yannakais,et al. Embedding planar graphs in four pages , 1989, STOC 1989.

[5] L. Faria,et al. An improved upper bound on the crossing number of the hypercube , 2008 .

[6] Oswin Aichholzer,et al. The 2-Page Crossing Number of $$K_{n}$$Kn , 2013, Discret. Comput. Geom..

[7] Arnold L. Rosenberg,et al. Embedding graphs in books: a layout problem with applications to VLSI design , 1985 .

[8] Etienne de Klerk,et al. Improved Lower Bounds for the 2-Page Crossing Numbers of Km, n and Kn via Semidefinite Programming , 2011, SIAM J. Optim..

[9] R. Bruce Richter,et al. The crossing number of c4 × c4 , 1995, J. Graph Theory.

[10] József Balogh,et al. k-Sets, Convex Quadrilaterals, and the Rectilinear Crossing Number of Kn , 2006, Discret. Comput. Geom..

[11] David S. Johnson,et al. Crossing Number is NP-Complete , 1983 .

[12] Christoph Buchheim,et al. Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem , 2006, COCOON.

[13] Sumio Masuda,et al. Crossing Minimization in Linear Embeddings of Graphs , 1990, IEEE Trans. Computers.