2-decomposable, 3-decomposable multipaths and t-decomposable spiders
碩士 === 國立中央大學 === 數學研究所 === 95 === A graph G is t-decomposable if and only if G can be decomposed into t isomorphic subgraphs. A multipath is a path with multiple edges allowed. A spider is a tree which has a unique vertex with degree ≥ 3. In this thesis, we investigate 2-decomposable and 3-decompos...
| Main Authors: | , |
|---|---|
| Format: | Others |
| Language: | en_US |
| Published: |
2007
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/52342518471055604660 |