The following pages link to Gelasio Salazar (Q592625):
Displaying 50 items.
- (Q413271) (redirect page) (← links)
- Visibility-preserving convexifications using single-vertex moves (Q413272) (← links)
- On \(\leq k\)-edges, crossings, and halving lines of geometric drawings of \(K _{n }\) (Q443913) (← links)
- The optimal drawings of \(K_{5,n}\) (Q463036) (← links)
- The number of generalized balanced lines (Q603873) (← links)
- Nested cycles in large triangulations and crossing-critical graphs (Q765192) (← links)
- An extended lower bound on the number of(\(\leqslant k\))-edges to generalized configurations of points and the pseudolinear crossing number of \(K_n\) (Q958731) (← links)
- 3-symmetric and 3-decomposable geometric drawings of \(K_n\) (Q987669) (← links)
- The crossing number of a projective graph is quadratic in the face-width (Q1010759) (← links)
- Drawings of \(C_m\times C_n\) with one disjoint family (Q1306302) (← links)
- On the intersections of systems of curves (Q1306421) (← links)
- Optimal meshes of curves in the Klein bottle (Q1405111) (← links)
- Infinite families of crossing-critical graphs with given average degree (Q1408896) (← links)
- The crossing number of \(P(N,3)\) (Q1606038) (← links)
- On a crossing number result of Richter and Thomassen (Q1850470) (← links)
- Drawings of \(C_m\times C_n\) with one disjoint family. II (Q1850541) (← links)
- Small meshes of curves and their role in the analysis of optimal meshes (Q1869201) (← links)
- Embedding grids in surfaces (Q1883290) (← links)
- An improved bound for the crossing number of \(C_m\times C_n\): a self-contained proof using mostly combinatorial arguments (Q1889832) (← links)
- Zarankiewicz's conjecture is finite for each fixed \(m\) (Q1945996) (← links)
- Large convex holes in random point sets (Q1947987) (← links)
- Making a graph crossing-critical by multiplying its edges (Q1953450) (← links)
- Embeddability of arrangements of pseudocircles and graphs on surfaces (Q2197691) (← links)
- Toroidal grid minors and stretch in embedded graphs (Q2284733) (← links)
- The knots that lie above all shadows (Q2334036) (← links)
- The 2-page crossing number of \(K_{n}\) (Q2391708) (← links)
- When can a link be obtained from another using crossing exchanges and smoothings? (Q2415944) (← links)
- Book drawings of complete bipartite graphs (Q2440102) (← links)
- Simple Euclidean arrangements with no \((\geq 5)\)-gons (Q2465414) (← links)
- \(k\)-sets, convex quadrilaterals, and the rectilinear crossing number of \(K_{n}\) (Q2498933) (← links)
- On the length of longest alternating paths for multicoloured point sets in convex position (Q2502908) (← links)
- Shellable drawings and the cylindrical crossing number of \(K_n\) (Q2514231) (← links)
- Master-slave synchronization of affine cellular automaton pairs (Q2568584) (← links)
- On the intersection number of matchings and minimum weight perfect matchings of multicolored point sets (Q2573797) (← links)
- On the crossing numbers of loop networks and generalized Petersen graphs (Q2575797) (← links)
- Characterizing 2-crossing-critical graphs (Q2635081) (← links)
- (Q2712518) (← links)
- (Q2712593) (← links)
- A cryptosystem based on cellular automata (Q2727160) (← links)
- Large Area Convex Holes in Random Point Sets (Q2821621) (← links)
- Improved Lower Bounds on Book Crossing Numbers of Complete Graphs (Q2848524) (← links)
- The Rectilinear Crossing Number of K n : Closing in (or Are We?) (Q2849795) (← links)
- (Q2857359) (← links)
- (Q2857403) (← links)
- The 2-page crossing number of K <sub>n</sub> (Q2874601) (← links)
- On the Pseudolinear Crossing Number (Q2978177) (← links)
- Stars and bonds in crossing-critical graphs (Q3069675) (← links)
- The crossing number ofCm �Cn is as conjectured forn ?m(m + 1) (Q3156923) (← links)
- Large harmonic sets of noncrossing edges for n randomly labeled vertices in convex position (Q3419616) (← links)
- Nearly light cycles in embedded graphs and crossing-critical graphs (Q3419707) (← links)
