
doi: 10.1002/rsa.20221
AbstractThe biplanar crossing number cr2(G) of a graph G is min{cr(G1) + cr(G2)}, where cr is the planar crossing number. We show that cr2(G) ≤ (3/8)cr(G). Using this result recursively, we bound the thickness by Θ(G) ‐ 2 ≤ Kcr2(G)0.4057 log2n with some constant K. A partition realizing this bound for the thickness can be obtained by a polynomial time randomized algorithm. We show that for any size exceeding a certain threshold, there exists a graph G of this size, which simultaneously has the following properties: cr(G) is roughly as large as it can be for any graph of that size, and cr2(G) is as small as it can be for any graph of that size. The existence is shown using the probabilistic method. © 2008 Wiley Periodicals, Inc. Random Struct. Alg., 2008
graph drawing, biplanar crossing number, Random graphs (graph-theoretic aspects), crossing number, thickness, Planar graphs; geometric and topological aspects of graph theory
graph drawing, biplanar crossing number, Random graphs (graph-theoretic aspects), crossing number, thickness, Planar graphs; geometric and topological aspects of graph theory
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 9 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
