Pages that link to "Item:Q817025"

The following pages link to On the crossing number of complete graphs (Q817025):

Displaying 14 items.

• Convexity minimizes pseudo-triangulations (Q598549) (← links)
• Simple realizability of complete abstract topological graphs in P (Q633211) (← links)
• On the crossing number of complete graphs (Q817025) (← links)
• Geometric drawings of \(K_{n}\) with few crossings (Q868888) (← links)
• Abstract order type extension and new results on the rectilinear crossing number (Q870421) (← links)
• An extended lower bound on the number of(\(\leqslant k\))-edges to generalized configurations of points and the pseudolinear crossing number of \(K_n\) (Q958731) (← links)
• 3-symmetric and 3-decomposable geometric drawings of \(K_n\) (Q987669) (← links)
• On the number of plane geometric graphs (Q2373434) (← links)
• A lower bound for the rectilinear crossing number (Q2573799) (← links)
• (Q2857422) (← links)
• The Crossing Number of Graphs: Theory and Computation (Q3644730) (← links)
• An Ongoing Project to Improve the Rectilinear and the Pseudolinear Crossing Constants (Q5119386) (← links)
• The Complexity of Several Realizability Problems for Abstract Topological Graphs (Q5452218) (← links)
• Turán’s Brick Factory Problem: The Status of the Conjectures of Zarankiewicz and Hill (Q5506784) (← links)