The following pages link to (Q2816149):
Displaying 23 items.
- Balanced simplices (Q472924) (← links)
- Circle lattice point problem, revisited (Q482222) (← links)
- Reconstructing orthogonal polyhedra from putative vertex sets (Q634249) (← links)
- On triconnected and cubic plane graphs on given point sets (Q833718) (← links)
- Generating restricted classes of involutions, Bell and Stirling permutations (Q966165) (← links)
- On a sphere that passes through \(n\) lattice points (Q966171) (← links)
- Extremal cliques in Steinhaus graphs (Q973115) (← links)
- A supplementary note on the irregularities of distributions (Q1228499) (← links)
- Finding parity difference by involutions (Q1356534) (← links)
- On rooks, marriages, and matchings or Steinhaus via Hall (Q1741591) (← links)
- Generating strings for bipartite Steinhaus graphs (Q1894762) (← links)
- Restricted compositions and permutations: from old to new Gray codes (Q1944104) (← links)
- Generating linear extensions of posets by transpositions (Q2368024) (← links)
- On polyhedra induced by point sets in space (Q2462350) (← links)
- Irregularities in the distributions of finite sequences (Q2540743) (← links)
- Optimal Embedded and Enclosing Isosceles Triangles (Q6066459) (← links)
- Constructing the first (and coolest) fixed-content universal cycle (Q6103527) (← links)
- Tetrahedra with congruent facet pairs (Q6121462) (← links)
- Celebrating Loday's associahedron (Q6139351) (← links)
- On a problem of Steinhaus (Q6179393) (← links)
- Generating signed permutations by twisting two-sided ribbons (Q6547921) (← links)
- On the hardness of Gray code problems for combinatorial objects (Q6575387) (← links)
- Non-crossing Hamiltonian paths and cycles in output-polynomial time (Q6614115) (← links)
