标题:The Linear Arboricity of Planar Graphs with Maximum Degree at least 7
作者: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 Jinan, Sch Math & Stat, Jinan 250014, 更多
通讯作者:Wu, JL
通讯作者地址:[Wu, JL]Shandong Univ, Sch Math, Jinan 250100, Shandong, Peoples R China.
来源:UTILITAS MATHEMATICA
出版年:2013
卷:90
页码:199-218
关键词:planar graph; linear arboricity; cycle
摘要:The linear arboricity 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 two fixed integers i and j (3 <= i <= j <= 5), if a planar graph G has the maximum degree at least 7 and any two cycles of length i and j, respectively, are not adjacent, then its linear arboricity is inverted right perpendicular Delta(G)/2inverted left perpendicular.
收录类别:SCOPUS;SCIE
WOS核心被引频次:1
Scopus被引频次:3
资源类型:期刊论文
原文链接:https://www.scopus.com/inward/record.uri?eid=2-s2.0-84882289619&partnerID=40&md5=2e984f68457ce201b122e410cee5c616
TOP