Pages that link to "Item:Q2391708"

The following pages link to The 2-page crossing number of \(K_{n}\) (Q2391708):

Displaying 27 items.

• The crossing number of seq-shellable drawings of complete graphs (Q1671011) (← links)
• 1-page and 2-page drawings with bounded number of crossings per edge (Q1678086) (← links)
• Bounding the number of non-duplicates of the \(q\)-side in simple drawings of \(K_{p,q}\) (Q2053730) (← links)
• A contribution to Guy's conjecture (Q2096940) (← links)
• The crossing number of twisted graphs (Q2163801) (← links)
• Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\) (Q2256586) (← links)
• The bipartite-cylindrical crossing number of the complete bipartite graph (Q2308490) (← links)
• On the crossing number of 2-page book drawings of \(K_n\) with prescribed number of edges in each page (Q2308500) (← links)
• Shellable drawings and the cylindrical crossing number of \(K_n\) (Q2514231) (← links)
• The same upper bound for both: the 2-page and the rectilinear crossing numbers of the \(n\)-cube (Q2825477) (← links)
• The \(2\)-page crossing number of \(K_n\) (Q2874601) (← links)
• Improved lower bounds for the 2-page crossing numbers of \(K_{m,n}\) and \(K_n\) via semidefinite programming (Q2910885) (← links)
• Topological Drawings of Complete Bipartite Graphs (Q2961537) (← links)
• Bishellable drawings of $K_n$ (Q4555043) (← links)
• Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth (Q4611385) (← links)
• A note on the cross-index of a complete graph based on a linear tree (Q4692245) (← links)
• Extending Drawings of Complete Graphs into Arrangements of Pseudocircles (Q4992833) (← links)
• The 2-page crossing number of \(C (3k, k)\) (Q4996075) (← links)
• Closing in on Hill's Conjecture (Q5232152) (← links)
• Turán’s Brick Factory Problem: The Status of the Conjectures of Zarankiewicz and Hill (Q5506784) (← links)
• One- and two-page crossing numbers for some types of graphs (Q5747710) (← 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)
• (Q6204659) (← links)
• On book crossing numbers of the complete graph (Q6552472) (← links)
• Bounding the tripartite-circle crossing number of complete tripartite graphs (Q6621173) (← links)