| THE LINEAR ARBORICITY OF COMPOSITION GRAPHS |
| |
| 引用本文： | WU Jianliang (Department of Economics,Shandong University of Science and Technology,Jinan 250031,China)LIU Guizhen (School of Mathematics,Shandong University,Jinan 250100,China)WU Yuliang(Department of Computer Science and Engineering,The Chinese University of Hong Kong,Hong Kong). THE LINEAR ARBORICITY OF COMPOSITION GRAPHS[J]. 系统科学与复杂性, 2002, 0(4) |
| |
| 作者姓名： | WU Jianliang (Department of Economics Shandong University of Science and Technology Jinan 250031 China)LIU Guizhen (School of Mathematics Shandong University Jinan 250100 China)WU Yuliang(Department of Computer Science and Engineering The Chinese University of Hong Kong Hong Kong) |
| |
| 作者单位： | WU Jianliang (Department of Economics，Shandong University of Science and Technology，Jinan 250031，China)LIU Guizhen (School of Mathematics，Shandong University，Jinan 250100，China)WU Yuliang(Department of Computer Science and Engineering，The Chinese University of Hong Kong，Hong Kong) |
| |
| 基金项目： | This work is partially supported by National Natural Science foundation of China，Doctoral foundation of the Education Committee of China. |
| |
| 摘 要： | The linear arboricity la(G) of a graph G is the minimum number of linear forests which partition the edges of G. Akiyama, Exoo and Harary conjectured that la(G) = [△(G) 1/2] for any regular graph G. In this paper, we prove the conjecture for some composition graphs, in particular, for complete multipartite graphs.
|
THE LINEAR ARBORICITY OF COMPOSITION GRAPHS |
| |
| WU Jianliang. THE LINEAR ARBORICITY OF COMPOSITION GRAPHS[J]. Journal of Systems Science and Complexity, 2002, 0(4) |
| |
| Authors: | WU Jianliang |
| |
| Abstract: | |
| |
| Keywords: | Graph composition of graphs linear arboricity complete multipartite graph. |
| 本文献已被 CNKI 等数据库收录！ |
