The following pages link to (Q4352316):
Displaying 30 items.
- Planar crossing numbers of graphs of bounded genus (Q452001) (← links)
- On the Erdős distinct distances problem in the plane (Q482909) (← links)
- Crossing number and weighted crossing number of near-planar graphs (Q548655) (← links)
- Some provably hard crossing number problems (Q1176321) (← links)
- Upper bounds for ropelength as a function of crossing number. (Q1421981) (← links)
- A successful concept for measuring non-planarity of graphs: The crossing number. (Q1422437) (← links)
- A new lower bound for the bipartite crossing number with applications (Q1575746) (← links)
- Algorithms for the fixed linear crossing number problem (Q1613416) (← links)
- The crossing number of locally twisted cubes \(L T Q_n\) (Q1671371) (← links)
- Which crossing number is it anyway? (Q1850498) (← links)
- Crossing number, pair-crossing number, and expansion (Q1880792) (← links)
- Computing crossing numbers in quadratic time (Q1887712) (← links)
- The graph crossing number and its variants: a survey (Q1953539) (← links)
- The outerplanar crossing number of the complete bipartite graph (Q2172421) (← links)
- The bipartite-cylindrical crossing number of the complete bipartite graph (Q2308490) (← links)
- Improvement on the decay of crossing numbers (Q2376099) (← links)
- Crossing number additivity over edge cuts (Q2444731) (← links)
- Approximating the fixed linear crossing number (Q2456999) (← links)
- On the decay of crossing numbers (Q2464150) (← links)
- An analysis of some linear graph layout heuristics (Q2491338) (← links)
- On the Pseudolinear Crossing Number (Q2978177) (← links)
- Bounds for Convex Crossing Numbers (Q3082956) (← links)
- An improved upper bound on the crossing number of the hypercube (Q3605145) (← links)
- Crossing and Weighted Crossing Number of Near-Planar Graphs (Q3611835) (← links)
- The Crossing Number of Graphs: Theory and Computation (Q3644730) (← links)
- (Q4457000) (← links)
- Improvement on the Decay of Crossing Numbers (Q5452206) (← links)
- Crossing Numbers and Parameterized Complexity (Q5452207) (← links)
- Turán’s Brick Factory Problem: The Status of the Conjectures of Zarankiewicz and Hill (Q5506784) (← links)
- SOFSEM 2005: Theory and Practice of Computer Science (Q5711561) (← links)
