Network pearls climb stairs: a new game on graphs and its optimal solution

Ricky Xiao-Feng Chen

Let $G$ be a graph, and $a$ and $b$ be integers. Suppose there are infinite number of stairs, numbering level $0$, level $1$, etc. How do you place every vertex of the graph $G$ on…