The following pages link to (Q4821954):
Displaying 41 items.
- Max point-tolerance graphs (Q344833) (← links)
- On inducing polygons and related problems (Q359751) (← links)
- A note on light geometric graphs (Q389475) (← links)
- Improved degree conditions for 2-factors with \(k\) cycles in Hamiltonian graphs (Q394360) (← links)
- A pseudoline counterexample to the strong Dirac conjecture (Q405230) (← links)
- Sphere and dot product representations of graphs (Q411410) (← links)
- Triangle contact representations and duality (Q443911) (← links)
- On convex geometric graphs with no \(k+1\) pairwise disjoint edges (Q503641) (← links)
- A note on the weak Dirac conjecture (Q521394) (← links)
- On the affine Sylvester problem (Q531604) (← links)
- Coding and counting arrangements of pseudolines (Q644821) (← links)
- Arrangements of pseudocircles and circles (Q741610) (← links)
- On degree sequences and eccentricities in pseudoline arrangement graphs (Q831726) (← links)
- Greedy drawings of triangulations (Q848683) (← links)
- Orthogonal surfaces and their CP-orders (Q925257) (← links)
- Schnyder woods and orthogonal surfaces (Q946686) (← links)
- Adjacency posets of planar graphs (Q966048) (← links)
- Bijective counting of plane bipolar orientations and Schnyder woods (Q1039437) (← links)
- On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings (Q1741861) (← links)
- Order distances and split systems (Q2160024) (← links)
- Convex grid drawings of planar graphs with constant edge-vertex resolution (Q2169950) (← links)
- Tukey depth histograms (Q2169954) (← links)
- On arrangements of orthogonal circles (Q2206852) (← links)
- Grid drawings of graphs with constant edge-vertex resolution (Q2230412) (← links)
- Root bundles and towards exact matter spectra of F-theory MSSMs (Q2237613) (← links)
- Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\) (Q2256586) (← links)
- Toroidal maps: Schnyder woods, orthogonal surfaces and straight-line representations (Q2441580) (← links)
- There are not too many magic configurations (Q2482202) (← links)
- Coloring copoints of a planar point set (Q2499594) (← links)
- Optimal algorithms for computing edge weights in planar split networks (Q2511048) (← links)
- Musings on an example of Danzer's (Q2519782) (← links)
- The Kashaev equation and related recurrences (Q2633025) (← links)
- Sampling and Counting 3-Orientations of Planar Triangulations (Q2804991) (← links)
- Upper and Lower Bounds on Long Dual Paths in Line Arrangements (Q2946411) (← links)
- Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces (Q3057631) (← links)
- On the Number of α-Orientations (Q3508567) (← links)
- When Can Splits be Drawn in the Plane? (Q5346560) (← links)
- Disjoint edges in geometric graphs (Q5925578) (← links)
- Strictly-convex drawings of 3-connected planar graphs (Q6117042) (← links)
- The geometry of chaotic dynamics --- a complex network perspective (Q6135100) (← links)
- Convex grid drawings of planar graphs with constant edge-vertex resolution (Q6199406) (← links)
