The following pages link to Crossing Number Problems (Q5680151):
Displayed 50 items.
- On \(\leq k\)-edges, crossings, and halving lines of geometric drawings of \(K _{n }\) (Q443913) (← links)
- Drawing disconnected graphs on the Klein bottle (Q604978) (← links)
- Bound for the 2-page fixed linear crossing number of hypercube graph via SDP relaxation (Q670454) (← links)
- On crossing numbers of hypercubes and cube connected cycles (Q688627) (← links)
- Crossing-critical edges and Kuratowski subgraphs of a graph (Q790824) (← links)
- Infinite families of crossing-critical graphs with a given crossing number (Q790825) (← links)
- On the crossing number of complete graphs (Q817025) (← links)
- Empty monochromatic triangles (Q833720) (← links)
- Abstract order type extension and new results on the rectilinear crossing number (Q870421) (← links)
- On \(k\)-gons and \(k\)-holes in point sets (Q899713) (← links)
- 3-symmetric and 3-decomposable geometric drawings of \(K_n\) (Q987669) (← links)
- Construction of crossing-critical graphs (Q1088998) (← links)
- A lower bound for the optimal crossing-free Hamiltonian cycle problem (Q1091399) (← links)
- Some provably hard crossing number problems (Q1176321) (← links)
- Coloring drawings of bipartite graphs: A problem in automated assembly (Q1208463) (← links)
- The crossing number of \(C_3\times C_n\) (Q1248631) (← links)
- Bisection width of transposition graphs (Q1392578) (← links)
- A successful concept for measuring non-planarity of graphs: The crossing number. (Q1422437) (← links)
- A new lower bound for the bipartite crossing number with applications (Q1575746) (← links)
- The crossing numbers of join of some graphs with \(n\) isolated vertices (Q1656906) (← links)
- The crossing number of locally twisted cubes \(L T Q_n\) (Q1671371) (← links)
- The crossing number of join of the generalized Petersen graph \(P(3, 1)\) with path and cycle (Q1708383) (← links)
- Drawings of graphs on surfaces with few crossings (Q1920424) (← links)
- On weighted sums of numbers of convex polygons in point sets (Q2167313) (← links)
- The crossing number of \(K_{5,n+1} \setminus e\) (Q2177670) (← links)
- The crossing number of Cartesian product of 5-wheel with any tree (Q2214315) (← links)
- \(K_7\)-minors in optimal 1-planar graphs (Q2400554) (← links)
- The crossing number of the Cartesian product of paths with complete graphs (Q2449179) (← links)
- The crossing number of \(K_{1,4,n}\) (Q2477388) (← links)
- On the crossing numbers of loop networks and generalized Petersen graphs (Q2575797) (← links)
- On the central levels problem (Q2692785) (← links)
- (Q2777504) (← links)
- Approximating the Maximum Rectilinear Crossing Number (Q2817887) (← links)
- The Same Upper Bound for Both: The 2-page and the Rectilinear Crossing Numbers of the<i>n</i>-Cube (Q2825477) (← links)
- An upper bound for the crossing number of augmented cubes (Q2868165) (← links)
- Monotone Crossing Number (Q3223961) (← links)
- (Q3300700) (← links)
- Graph minors and the crossing number of graphs (Q3439581) (← links)
- The maximum number of halving lines and the rectilinear crossing number of for (Q3503562) (← links)
- A central approach to bound the number of crossings in a generalized configuration (Q3503564) (← links)
- (Q4018745) (← links)
- The crossing numbers of products of paths and stars with 4‐vertex graphs (Q4309988) (← links)
- A lower bound for the crossing number ofCm � Cn (Q4521491) (← links)
- (Q4608524) (← links)
- On 5-Gons and 5-Holes (Q4899260) (← links)
- 2-Layer k-Planar Graphs (Q5014133) (← links)
- Plane Spanning Trees in Edge-Colored Simple Drawings of $$K_{n}$$ (Q5014139) (← links)
- A survey of graphs with known or bounded crossing numbers (Q5139701) (← links)
- Optimal crossing-free Hamiltonian circuit drawings of \(K_n\) (Q5904318) (← links)
- Optimal crossing-free Hamiltonian circuit drawings of \(K_n\) (Q5905997) (← links)