Pages that link to "Item:Q5434249"

The following pages link to The crossing number of <i>K</i>₁₁ is 100 (Q5434249):

Displaying 31 items.

• On the crossing number of \(K_{13}\) (Q490997) (← links)
• The crossing number of \(K_{1,m,n}\) (Q998333) (← links)
• An evolutionary formulation of the crossing number problem (Q1040098) (← links)
• The crossing number of locally twisted cubes \(L T Q_n\) (Q1671371) (← links)
• Crossing number for graphs with bounded pathwidth (Q1986966) (← links)
• A contribution to Guy's conjecture (Q2096940) (← links)
• The crossing number of \(K_{5,n+1} \setminus e\) (Q2177670) (← links)
• Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\) (Q2256586) (← links)
• Empty triangles in good drawings of the complete graph (Q2345507) (← links)
• \(K_7\)-minors in optimal 1-planar graphs (Q2400554) (← links)
• The early history of the brick factory problem (Q2431395) (← links)
• The crossing number of the Cartesian product of paths with complete graphs (Q2449179) (← links)
• Shellable drawings and the cylindrical crossing number of \(K_n\) (Q2514231) (← links)
• Fan-crossing free graphs and their relationship to other beyond-planar graphs (Q2663047) (← links)
• (Q2857422) (← links)
• An upper bound for the crossing number of augmented cubes (Q2868165) (← links)
• An effective crossing minimisation heuristic based on star insertion (Q3121515) (← links)
• On the Crossing Number of Kn without Computer Assistance (Q3188671) (← links)
• The Crossing Number of Graphs: Theory and Computation (Q3644730) (← links)
• Bishellable drawings of $K_n$ (Q4555043) (← links)
• A note on the cross-index of a complete graph based on a linear tree (Q4692245) (← links)
• On Numerical Invariant of Graph (Q5029640) (← links)
• (Q5136229) (← links)
• A survey of graphs with known or bounded crossing numbers (Q5139701) (← links)
• Closing in on Hill's Conjecture (Q5232152) (← links)
• Recent Advances in Exact Crossing Minimization (Extended Abstract) (Q5300976) (← links)
• Turán’s Brick Factory Problem: The Status of the Conjectures of Zarankiewicz and Hill (Q5506784) (← links)
• Bounding the tripartite‐circle crossing number of complete tripartite graphs (Q6057580) (← links)
• From art and circuit design to geometry and combinatorics (Q6064580) (← links)
• Drawings of complete graphs in the projective plane (Q6080857) (← links)
• On the problems of CF-connected graphs (Q6090328) (← links)