Pages that link to "Item:Q2910885"

The following pages link to Improved lower bounds for the 2-page crossing numbers of \(K_{m,n}\) and \(K_n\) via semidefinite programming (Q2910885):

Displaying 10 items.

• The optimal drawings of \(K_{5,n}\) (Q463036) (← links)
• Bound for the 2-page fixed linear crossing number of hypercube graph via SDP relaxation (Q670454) (← links)
• On the crossing number of \(K_{m,n}\) (Q1408549) (← links)
• The 2-page crossing number of \(K_{n}\) (Q2391708) (← links)
• Book drawings of complete bipartite graphs (Q2440102) (← links)
• The same upper bound for both: the 2-page and the rectilinear crossing numbers of the \(n\)-cube (Q2825477) (← links)
• Improved lower bounds on book crossing numbers of complete graphs (Q2848524) (← links)
• The \(2\)-page crossing number of \(K_n\) (Q2874601) (← links)
• Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth (Q4611385) (← links)
• Improved Bounds for the Crossing Numbers of Km,n and Kn (Q5470826) (← links)