THE LINEAR ARBORICITY 0F COMPOSITl0N GRAPHS

编号 zgly0000283966

文献类型 期刊论文

文献题名 THE LINEAR ARBORICITY 0F COMPOSITl0N GRAPHS

作者 WU  Jianliang  LIU  Guizhen  Yuliang 

作者单位 Department  of  Economics  Shandong  University 

母体文献 Journal of Systems Science and Complexity;系统科学与复杂性: 英文版 

年卷期 2002,15(4)

页码 372-375

年份 2002 

分类号 O157.5 

关键词 森林  可分解图  完全多部图  Akiyama-Exoo-Harary猜想  有向图  简单图  无向图 

文摘内容 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 papedr,we prove the conjecture for some composition graphs,in particular,forcomplets multipartite graphs。