Linear Arboricity and Star Arboricity of Graphs
博士 === 國立中央大學 === 數學研究所 === 91 === Let G be a graph. The unrestricted path number of G, denoted by ho(G), is the minimum number of paths needed to cover the edges of G. The arboricity of G, denoted by a(G), is the minimum number of forests needed to decompose the edges of G. A linear forest is...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2003
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/89459067031029073176 |