The $n$ dimensional hypercube $Q_n$ is a graph that has a vertex $v_s$ for each string $s \in \{0, 1\}^n$ and an edge between two vertices $v_s$ and $v_t$ if and only if the Hamming distance between $s$ and $t$ is $1$. I would like to find directed hamiltonian cycles in this graph that satisfy a...

How should we respond to questions from unregistered users? Should we treat them differently from questions from registered users? For example: Should we post comments encouraging users to register? Is it OK to suggest to posters that they might be more likely to get answers if they register, ...