Pages that link to "Item:Q4201390"
From MaRDI portal
The following pages link to Bounds for rectilinear crossing numbers (Q4201390):
Displayed 24 items.
- The complexity of tensor rank (Q722207) (← links)
- Removing even crossings (Q885288) (← links)
- Some provably hard crossing number problems (Q1176321) (← links)
- A successful concept for measuring non-planarity of graphs: The crossing number. (Q1422437) (← links)
- Note on \(k\)-planar crossing numbers (Q1699274) (← links)
- Which crossing number is it anyway? (Q1850498) (← links)
- On the degenerate crossing number (Q1953051) (← links)
- Parameterized analysis and crossing minimization problems (Q2172859) (← links)
- Weighted Turán problems with applications (Q2319696) (← links)
- Approximating the rectilinear crossing number (Q2331210) (← links)
- The early history of the brick factory problem (Q2431395) (← links)
- Space Crossing Numbers (Q2888867) (← links)
- Approximating the Rectilinear Crossing Number (Q2961535) (← links)
- On the Pseudolinear Crossing Number (Q2978177) (← links)
- Hanani-Tutte and Monotone Drawings (Q3104784) (← links)
- Monotone Crossing Number (Q3223961) (← links)
- The Crossing Number of Graphs: Theory and Computation (Q3644730) (← links)
- New results on rectilinear crossing numbers and plane embeddings (Q4020698) (← links)
- Crossing numbers of random graphs (Q4798172) (← links)
- On the crossing number for Kronecker product of a tripartite graph with path (Q4956189) (← links)
- Crossing Numbers of Beyond-Planar Graphs Revisited (Q5084712) (← links)
- Complexity of Geometric k-Planarity for Fixed k (Q5144878) (← links)
- Turán’s Brick Factory Problem: The Status of the Conjectures of Zarankiewicz and Hill (Q5506784) (← links)
- Reviews (Q5742363) (← links)