Pages that link to "Item:Q817025"

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

Displaying 39 items.

• Convexity minimizes pseudo-triangulations (Q598549) (← links)
• On crossing numbers of geometric proximity graphs (Q632725) (← links)
• Simple realizability of complete abstract topological graphs in P (Q633211) (← links)
• On the Orchard crossing number of the complete bipartite graphs (Q640465) (← 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)
• Special numbers of crossings for complete graphs (Q1349080) (← links)
• The number of crossings in multigraphs with no empty lens (Q1725755) (← links)
• The crossing number of twisted graphs (Q2163801) (← links)
• A crossing lemma for multigraphs (Q2189737) (← links)
• Counting the number of crossings in geometric graphs (Q2224846) (← links)
• The rectilinear local crossing number of \(K_{n}\) (Q2363361) (← links)
• On the number of plane geometric graphs (Q2373434) (← links)
• On crossing families of complete geometric graphs (Q2416466) (← links)
• A lower bound for the rectilinear crossing number (Q2573799) (← links)
• Expected crossing numbers (Q2857422) (← links)
• On the Number of Edges of Fan-Crossing Free Graphs (Q2872081) (← links)
• Infinite families of crossing-critical graphs with prescribed average degree and crossing number (Q3055931) (← links)
• On the Crossing Number of Kn without Computer Assistance (Q3188671) (← links)
• Graph minors and the crossing number of graphs (Q3439581) (← links)
• On the crossing number of some complete multipartite graphs (Q3561431) (← links)
• The Crossing Number of Graphs: Theory and Computation (Q3644730) (← links)
• On 3‐regular graphs having crossing number at least 2 (Q4317224) (← links)
• Reporting the crossing-free segments of a complete geometric graph (Q4332449) (← links)
• Relations Between Crossing Numbers of Complete and Complete Bipartite Graphs (Q4340676) (← links)
• (Q4552009) (← links)
• A note on the cross-index of a complete graph based on a linear tree (Q4692245) (← links)
• Crossing numbers of random graphs (Q4798172) (← links)
• The Rectilinear Crossing Number of a Complete Graph and Sylvester's "Four Point Problem" of Geometric Probability (Q4859605) (← links)
• An Ongoing Project to Improve the Rectilinear and the Pseudolinear Crossing Constants (Q5119386) (← links)
• The crossing number of <i>K</i>₁₁ is 100 (Q5434249) (← 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)
• (Q5688095) (← links)
• Crossing graphs of fiber-complemented graphs (Q5899397) (← links)
• The rectilinear crossing number of \(K_{10}\) is 62 (Q5934081) (← links)