Outerplanar crossing numbers, the circular arrangement problem and isoperimetric functions (original) (raw)
Related papers
New bounds on the biplanar crossing number of low-dimensional hypercubes: How low can you go?
Bulletin of the Institute of Combinatorics and its Applications, 2018
How Low Can You Go? New Bounds on the Biplanar Crossing Number of Low-dimensional Hypercubes
2017
Crossing Numbers and Hard Erdős Problems in Discrete Geometry
Combinatorics, Probability and Computing, 1997
General Lower Bounds for the Minor Crossing Number of Graphs
Discrete & Computational Geometry, 2010
On crossing numbers of geometric proximity graphs
Computational Geometry, 2011
An improvement of the crossing number bound
Journal of Graph Theory, 2005
Bound for the 2-Page Fixed Linear Crossing Number of Hypercube Graph via SDP Relaxation
Journal of Applied Mathematics
Discrete Applied Mathematics, 2007
Outerplanar crossing numbers of planar graphs
On the rectilinear crossing number of complete uniform hypergraphs
2017
C O ] 1 0 Ju l 2 01 8 USING BLOCK DESIGNS IN CROSSING NUMBER BOUNDS
Crossing numbers of graphs, lower bound techniques and algorithms: A survey
Lecture Notes in Computer Science, 1995
On Crossings in Geometric Proximity Graphs
2009
Improved upper bounds on the crossing number
Proceedings of the twenty-fourth annual symposium on Computational geometry - SCG '08, 2008
One-and two-page crossing numbers for some types of graphs
Crossing Number and Weighted Crossing Number of Near-Planar Graphs
Algorithmica, 2009
Crossing and Weighted Crossing Number of Near-Planar Graphs
Lecture Notes in Computer Science, 2009
New Lower Bounds for the Number of (≤ k)-Edges and the Rectilinear Crossing Number of Kn
Discrete & Computational Geometry, 2007
A new lower bound for the bipartite crossing number with applications
Theoretical Computer Science, 2000
A lower bound for crossing numbers of graphs with applications to Kn, Kp,q, and Q(d)
Journal of Combinatorial Theory, Series B, 1972
Balanced Circle Packings for Planar Graphs
Lecture Notes in Computer Science, 2014
On Graph Crossing Number and Edge Planarization
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011
On some packing and partition problems in geometric graphs
2018
On the k-planar local crossing number
Discrete Mathematics
Covering hypercubes by isometric paths
Richard Nowakowski, Ian Caines
Discrete Mathematics, 2001
Obstacle Numbers of Planar Graphs
Lecture Notes in Computer Science, 2018
Hyperplane arrangements with large average diameter: a computational approach
Arrangements of Hyperplanes — Sapporo 2009
Using block designs in crossing number bounds
Journal of Combinatorial Designs
Outerplanar Crossing Numbers of 3-Row Meshes, Halin Graphs and Complete p-Partite Graphs
Lecture Notes in Computer Science, 2005
Extremal Problems for Geometric Hypergraphs
Discrete and Computational Geometry, 1998
Biplanar Crossing Numbers I: A Survey of Results and Problems
Bolyai Society Mathematical Studies, 2006
Algorithms for the Hypergraph and the Minor Crossing Number Problems
Lecture Notes in Computer Science, 2007
Packing Graphs: The packing problem solved
Long Non-crossing Configurations in the Plane
Discrete & Computational Geometry, 2010
Improved Bounds for Planar K-Sets and Related Problems
Discrete and Computational Geometry, 1998