标题:The Linear Arboricity of Planar Graphs without 5-, 6-Cycles with Chords
作者:Chen, H.;Tan, X.;Wu, J.;Li, G.
作者机构:[Chen, H] School of Science, Shanghai Institute of Technology, Shanghai, 201418, China;[ Tan, X] School of Statistics and Mathematics, Shandong Univer 更多
通讯作者:Wu, JL
通讯作者地址:[Wu, JL]Shandong Univ, Sch Math, Jinan 250100, Shandong, Peoples R China.
来源:Graphs and combinatorics
出版年:2013
卷:29
期:3
页码:373-385
DOI:10.1007/s00373-011-1118-y
关键词:Cycle;Linear arboricity;Planar graph
摘要: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, ?Δ(G)?/2 if Δ(G) ≥ 7 and G has no 5-cycles with chords, or Δ(G) ≥ 5 and G has no 5-, 6-cycles with chords.
收录类别:SCOPUS;SCIE
WOS核心被引频次:2
Scopus被引频次:3
资源类型:期刊论文
原文链接:https://www.scopus.com/inward/record.uri?eid=2-s2.0-84877603597&doi=10.1007%2fs00373-011-1118-y&partnerID=40&md5=a4c2303d1a4b0b9a0328b51df8211c32
TOP