一、 設Q為一個重邊數為2，且總邊數可被3整除的多重路徑(multipaths)，則Q為可三分解的。 二、 設C為一個重邊數為2，且總邊數可被3整除的多重圈(multicycles)，則C為可三分解的。 ;Let G be a graph and t be a positive integer. A t-split of G is a partition of the edges of G into t isomorphic subgraphs. A graph is said to be t-splittable if it has a t-split. In this thesis we prove the following results.
Theorem. Let Q be a multipath with multiplicity 2 such that jE(Q)j=0 (mod 3). Then Q is 3-splittable.
Theorem. Let C be a multicycle with multiplicity 2 such that jE(C)j=0 (mod 3). Then C is 3-splittable.