The following pages link to (Q4767256):
Displaying 15 items.
- Circle lattice point problem, revisited (Q482222) (← links)
- The orchard visibility problem and some variants (Q927876) (← links)
- The weighted Fermat triangle problem (Q938499) (← links)
- An algorithm for determining an opaque minimal forest of a convex polygon (Q1107998) (← links)
- Cyclic designs and uniformly deep families (Q1139595) (← links)
- Graphs with cycles having adjacent lines different colors (Q1221118) (← links)
- Planar and infinite hypohamiltonian and hypotraceable graphs (Q1223315) (← links)
- Pairs of edge-disjoint Hamiltonian circuits (Q1227753) (← links)
- On convex bodies containing a given number of lattice points (Q1234915) (← links)
- Elementary geometry on the integer lattice (Q1662428) (← links)
- Visibility properties of spiral sets (Q2165897) (← links)
- The Fermat-Torricelli theorem in convex geometry (Q2176079) (← links)
- Planar lattices and equilateral polygons (Q2311373) (← links)
- Optimal quantization for uniform distributions on Cantor-like sets (Q2391006) (← links)
- (Q2985101) (← links)
