Scientiae Mathematicae Japonicae
Online ISSN : 1346-0447
PATH TRANSFERABILITY OF PLANAR GRAPHS
Ryuzo Torii
著者情報
ジャーナル フリー

2009 年 70 巻 3 号 p. 373-378

詳細
抄録
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.
著者関連情報
© 2009 International Society for Mathematical Sciences
前の記事 次の記事
feedback
Top