本篇論文主要在一些特殊的連通圖形中，討論把全部的邊都走過而使邊重覆最少的方法，主要結果如下：1.在連通網路中求封閉（開放）的全路徑之長度的最小上界。2.對於一些特殊連通圖形，找一個走過所有的邊，且邊的重覆次數最少的方法。 This paper studies the postman problem and its extended questions. Some results are obtained as indicated in following. 1. We derive the least upper bound of the length of any closed (open) whole walk.2. We will present the number of “edge repetitions” of a shortest closed (open) whole walk about some kinds of graphs.
