2-decomposable, 3-decomposable multipaths and t-decomposable spiders
張凱涵, Kai-han Chang · 2007
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-decomposable multipaths and t-decomposable spiders.