D. Pritikin

activity

20062017

most cited

k

-Dependence and Domination in Kings Graphs

1 citations · 1 across the 2 of their papers we have counts for

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2017

Hamiltonian cycles in $k$ -partite graphs

Louis DeBiasio, Robert A. Krueger, Dan Pritikin +1

Chen, Faudree, Gould, Jacobson, and Lesniak determined the minimum degree threshold for which a balanced $k$ -partite graph has a Hamiltonian cycle. We give an asymptotically tight…

math.CO2014

Embedding multidimensional grids into optimal hypercubes

Zevi Miller, Dan Pritikin, I. H. Sudborough

Let $G$ and $H$ be graphs, with $∣ V (H) ∣ \geq ∣ V (G) ∣$ , and $f : V (G) \to V (H)$ a one to one map of their vertices. Let $d i l a t i o n (f) = ma x {d i s t_{H} (f (x), f (y)) : x y \in E (G)}$ ,…

Hamiltonian cycles in k-partite graphs

Embedding multidimensional grids into optimal hypercubes

Hamiltonian cycles in $k$ -partite graphs