Bichromaticity of bipartite graphs. - Dan Pritikin (J. Graph Theory, 1985)

Applying a proof of tverberg to complete bipartite decompositions of digraphs and multigraphs. - Dan Pritikin (J. Graph Theory, 1986)

The bichromaticity of cylinder graphs and torus graphs. - Dan Pritikin (J. Graph Theory, 1987)

On the separation number of a graph. - Zevi Miller; Dan Pritikin (Networks, 1989)

The harmonious coloring number of a graph. - Zevi Miller; Dan Pritikin (Discret. Math., 1991)

Applying a result of Frankl and Rödl to the construction of Steiner trees in the hypercube. - Zevi Miller; Dan Pritikin (Discret. Math., 1994)

Near Embeddings of Hypercubes into Cayley Graphs on the Symmetric Group. - Zevi Miller; Dan Pritikin; Ivan Hal Sudborough (IEEE Trans. Computers, 1994)

Embedding hypercubes into pancake, cycle prefix and substring reversal networks. - Linda Gardner; Zevi Miller; Dan Pritikin; Ivan Hal Sudborough (HICSS (2), 1995)

Bounded Dilation Maps of Hypercubes into Cayley Graphs on the Symmetric Group. - Zevi Miller; Dan Pritikin; Ivan Hal Sudborough (Math. Syst. Theory, 1996)

On randomized greedy matchings. - Zevi Miller; Dan Pritikin (Random Struct. Algorithms, 1997)

All Unit-Distance Graphs of Order 6197 Are 6-Colorable. - Dan Pritikin (J. Comb. Theory B, 1998)

On Mapping Complete Binary Trees into Grids and Extended Grids. - Y.-B. Lin; Ivan Hal Sudborough; Zevi Miller; Dan Pritikin; Manley Perkel (ISPAN, 1999)

Expansion of layouts of complete binary trees into grids. - Y.-B. Lin; Zevi Miller; Manley Perkel; Dan Pritikin; Ivan Hal Sudborough (Discret. Appl. Math., 2003)

Irredundance and domination in kings graphs. - Odile Favaron; Gerd Fricke; Dan Pritikin; Joël Puech (Discret. Math., 2003)

Properly colored subgraphs and rainbow subgraphs in edge-colorings with local constraints. - Noga Alon; Tao Jiang 003; Zevi Miller; Dan Pritikin (Random Struct. Algorithms, 2003)

The sequential sum problem and performance bounds on the greedy algorithm for the on-line Steiner problem. - Zevi Miller; Dan Pritikin; Manley Perkel; Ivan Hal Sudborough (Networks, 2005)

Edge-Bandwidth of the Triangular Grid. - Reza Akhtar; Tao Jiang 003; Dan Pritikin (Electron. J. Comb., 2007)

k-Dependence and Domination in Kings Graphs. - Eugen J. Ionascu; Dan Pritikin; Stephen E. Wright (Am. Math. Mon., 2008)

On the Unitary Cayley Graph of a Finite Ring. - Reza Akhtar; Megan Boggess; Tiffany Jackson-Henderson; Isidora Jiménez; Rachel Karpman; Amanda Kinzel; Dan Pritikin (Electron. J. Comb., 2009)

A solitaire game played on 2-colored graphs. - David Craft; Zevi Miller; Dan Pritikin (Discret. Math., 2009)

Separation numbers of trees. - Tao Jiang 003; Zevi Miller; Dan Pritikin (Theor. Comput. Sci., 2009)

Representation Numbers of Stars. - Reza Akhtar; Anthony B. Evans; Dan Pritikin (Integers, 2010)

Near Optimal Bounds for Steiner Trees in the Hypercube. - Tao Jiang 003; Zevi Miller; Dan Pritikin (SIAM J. Comput., 2011)

Representation numbers of complete multipartite graphs. - Reza Akhtar; Anthony B. Evans; Dan Pritikin (Discret. Math., 2012)

Arrangements of k-sets with intersection constraints. - Tao Jiang 003; Manley Perkel; Dan Pritikin (Eur. J. Comb., 2012)

Embedding multidimensional grids into optimal hypercubes. - Zevi Miller; Dan Pritikin; Ivan Hal Sudborough (Theor. Comput. Sci., 2014)

Hamiltonian cycles in k -partite graphs. - Louis DeBiasio; Robert A. Krueger; Dan Pritikin; Eli Thompson (J. Graph Theory, 2020)