The Linear 5-Arboricity of Complete Multipartite Graphs
碩士 === 國立嘉義大學 === 應用數學系研究所 === 96 === If G_1, G_2,..., G_t are subgraphs of a graph G such that each edge of G appears in exactly one of the subgraphs, then we say that G can be decomposed into G_1, G_2,..., G_t. Besides, a linear k-forest is a graph whose components are paths of lengths at most...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Language: | en_US |
| Online Access: | http://ndltd.ncl.edu.tw/handle/5jubvp |