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 6 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)
• 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<i>n</i>-Cube (Q2825477) (← links)
• Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth (Q4611385) (← links)