3 problems

Let $g$ be a specified graph and $G$ a larger graph. Represent them by rigid simplexes $s$ and $S$, respectively, and dynamically dock these simplexes during the proposed physical…

Let $G$ be a pattern graph. For each positive integer $n$, let $\mathrm{SUB}(G)$ denote the Boolean function on inputs encoding an $n$-vertex host graph $H$ whose vertices are colo…

Let $G$ be a pattern graph. For each positive integer $n$, let $\mathrm{SUB}(G)$ denote the Boolean function on inputs encoding an $n$-vertex host graph $H$ whose vertices are colo…