The 3-split of multipaths and multicycles with multiplicity 2
碩士 === 國立中央大學 === 數學系 === 102 === 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...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2014
|
Online Access: | http://ndltd.ncl.edu.tw/handle/v4gm5e |