The following pages link to Dan Pritikin (Q409452):
Displaying 27 items.
- Representation numbers of complete multipartite graphs (Q409453) (← links)
- Arrangements of \(k\)-sets with intersection constraints (Q449216) (← links)
- Embedding multidimensional grids into optimal hypercubes (Q740976) (← links)
- Separation numbers of trees (Q837168) (← links)
- A solitaire game played on 2-colored graphs (Q998506) (← links)
- Edge-bandwidth of the triangular grid (Q1010627) (← links)
- Eigenvalues and separation in graphs (Q1209408) (← links)
- All unit-distance graphs of order 6197 are 6-colorable (Q1272487) (← links)
- Applying a result of Frankl and Rödl to the construction of Steiner trees in the hypercube (Q1332422) (← links)
- Irredundance and domination in kings graphs (Q1868843) (← links)
- On the unitary Cayley graph of a finite ring (Q2380281) (← links)
- (Q3033795) (← links)
- Representation Numbers of Stars (Q3068165) (← links)
- Near Optimal Bounds for Steiner Trees in the Hypercube (Q3115870) (← links)
- <i>κ</i>-Dependence and Domination in Kings Graphs (Q3621557) (← links)
- Applying a proof of tverberg to complete bipartite decompositions of digraphs and multigraphs (Q3720624) (← links)
- The bichromaticity of cylinder graphs and torus graphs (Q3752399) (← links)
- Bichromaticity of bipartite graphs (Q3816084) (← links)
- On the separation number of a graph (Q3833885) (← links)
- (Q4344227) (← links)
- Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints (Q4446871) (← links)
- The sequential sum problem and performance bounds on the greedy algorithm for the on‐line Steiner problem (Q4680416) (← links)
- Bounded dilation maps of hypercubes into Cayley graphs on the symmetric group (Q4717051) (← links)
- (Q4863517) (← links)
- (Q4871043) (← links)
- Hamiltonian cycles in k‐partite graphs (Q5110679) (← links)
- Near embeddings of hypercubes into Cayley graphs on the symmetric group (Q5375294) (← links)
