In this paper we propose a notion of pattern avoidance in binary trees t...
We say that a Hamilton cycle C=(x_1,…,x_n) in a graph G is
k-symmetric, ...
Given integers k≥ 2 and a_1,…,a_k≥ 1, let
a:=(a_1,…,a_k) and n:=a_1+⋯+a_...
The central levels problem asserts that the subgraph of the
(2m+1)-dimen...
We consider the problem of constructing a cyclic listing of all bitstrin...
Consider the graph that has as vertices all bitstrings of length 2n+1 wi...