抄録
We regard a path as a train moving on a graph. A graph G is called
n-transferable if any path of length n can be moved to any other such path by several
steps. We will show that every planar graph with minimum degree at least three is at
most 10 transferable.