标题:The Linear Arboricity of Planar Graphs without 5-Cycles with Chords
作者:Chen, Hong-Yu; Tan, Xiang; Wu, Jian-Liang
作者机构:[Chen, Hong-Yu] Shanghai Inst Technol, Sch Sci, Shanghai 201418, Peoples R China.; [Tan, Xiang] Shandong Univ Finance, Sch Math & Stat, Jinan 250014 更多
通讯作者:Chen, HY
通讯作者地址:[Chen, HY]Shanghai Inst Technol, Sch Sci, Shanghai 201418, Peoples R China.
来源:BULLETIN OF THE MALAYSIAN MATHEMATICAL SCIENCES SOCIETY
出版年:2013
卷:36
期:2
页码:285-290
关键词:Planar graph; linear arboricity; cycle
摘要:The linear arboricity la(G) of a graph G is the minimum number of linear forests which partition the edges of G. In this paper, it is proved that for a planar graph G with maximum degree Delta(G) >= 7, la(G) = [(Delta(G))/2] if G has no 5-cycles with chords.
收录类别:SCOPUS;SCIE
WOS核心被引频次:3
Scopus被引频次:5
资源类型:期刊论文
原文链接:https://www.scopus.com/inward/record.uri?eid=2-s2.0-84880130769&partnerID=40&md5=ca1901561c8da1b904f3f68c780e50d3
TOP