New bounds on the biplanar crossing number of low-dimensional hypercubes: How low can you go? (original) (raw)
Related papers
How Low Can You Go? New Bounds on the Biplanar Crossing Number of Low-dimensional Hypercubes
2017
Discrete Applied Mathematics, 2007
Bound for the 2-Page Fixed Linear Crossing Number of Hypercube Graph via SDP Relaxation
Journal of Applied Mathematics
On the rectilinear crossing number of complete uniform hypergraphs
2017
New Lower Bounds for the Number of (≤ k)-Edges and the Rectilinear Crossing Number of Kn
Discrete & Computational Geometry, 2007
C O ] 1 0 Ju l 2 01 8 USING BLOCK DESIGNS IN CROSSING NUMBER BOUNDS
A lower bound for crossing numbers of graphs with applications to Kn, Kp,q, and Q(d)
Journal of Combinatorial Theory, Series B, 1972
On the k-planar local crossing number
Discrete Mathematics
One-and two-page crossing numbers for some types of graphs
An improvement of the crossing number bound
Journal of Graph Theory, 2005
Biplanar Crossing Numbers I: A Survey of Results and Problems
Bolyai Society Mathematical Studies, 2006
On Graph Crossing Number and Edge Planarization
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011
Using block designs in crossing number bounds
Journal of Combinatorial Designs
Random Structures and Algorithms, 2008
Outerplanar crossing numbers of planar graphs
A new lower bound for the bipartite crossing number with applications
Theoretical Computer Science, 2000
Graphs drawn with few crossings per edge
Combinatorica, 1997
Outerplanar crossing numbers, the circular arrangement problem and isoperimetric functions
The electronic journal of combinatorics
General Lower Bounds for the Minor Crossing Number of Graphs
Discrete & Computational Geometry, 2010
The distinguishing number of the hypercube
Discrete Mathematics, 2004
Crossing and Weighted Crossing Number of Near-Planar Graphs
Lecture Notes in Computer Science, 2009
Crossing Number and Weighted Crossing Number of Near-Planar Graphs
Algorithmica, 2009
A survey of the theory of hypercube graphs
Computers & Mathematics With Applications, 1988
Improved upper bounds on the crossing number
Proceedings of the twenty-fourth annual symposium on Computational geometry - SCG '08, 2008
Covering hypercubes by isometric paths
Richard Nowakowski, Ian Caines
Discrete Mathematics, 2001
Journal of Combinatorial Theory, 1970
Crossing Numbers and Hard Erdős Problems in Discrete Geometry
Combinatorics, Probability and Computing, 1997
2014
Outerplanar Crossing Numbers of 3-Row Meshes, Halin Graphs and Complete p-Partite Graphs
Lecture Notes in Computer Science, 2005