期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

不含弦5-圈和弦6-圈的平面图的线性2-荫度 被引量：3

The linear 2-arboricity of planar graphs without 5-,6-cycles with chord
原文传递
导出
摘要 设G是不含弦5-圈和弦6-圈的平面图,证明了若G连通且δ(G)≥2,则G包含一条边xy,使得d(x)+d(y)≤9,或一个2-交错圈。根据这一结果,得到图G的线性2-荫度la2(G)≤Δ(G)2+6。 Let G be a planar graph without 5-,6-cycles with chord.It is proved that if G is connected and δ（G）≥2, than G contains an edge xy with d（x） ＋d（y）≤9 or a 2-alternating cycle.By this result, we obtain that G＆#39;s linear 2-arboricity la2 （G）≤ Δ（G）＋6. 2
作者 陈宏宇 张丽
机构地区 上海应用技术学院理学院 上海金融学院应用数学系
出处 《山东大学学报（理学版）》 CAS CSCD 北大核心 2014年第6期26-30,共5页 Journal of Shandong University(Natural Science)
基金 国家自然科学基金数学天元基金(11226291) 上海高校青年教师培养资助计划(ZZyyy12022) 上海应用技术学院人才引进项目(YJ2012-20)
关键词 平面图 线性 2-荫度 圈 planar graph linear 2-arboricity cycle
分类号 O157.5 [理学—基础数学]
  • 相关文献

参考文献13

  • 1BONDYJA,MURTYUUSR.Graphtheorywithapplication[M].NewYork:MacMillanPress,1976.
  • 2HABIBM,PEROCHEB.Someproblemsaboutlineararboricity[J].DiscreteMath,1982,41:219-220.
  • 3BERMONDJC,FIUQUETJL,HABIBM,etal.Onlinearkarboridty[J].DiscreteMath,1984,52:123-132.
  • 4JACKSONB,WORMALDNC.Onthelinearkarborictyofcubicgraphs[J].DiscreteMath,1996,162:293-297.
  • 5ALDREDREL,WORMALDNC.Moreonthelinearkarboricityofregulargraphs[J].AustralJCombin,1998,18:97-104.
  • 6FUHungLin,HUANGKuoChing.Thelinear2-arboricityofcompletebipartitegraphs[J].ArsCombin,1994,38:309-318.
  • 7CHENBorLiang,FUHungLin,HUANGKuoChing.Decomposinggraphsintoforestsofpathwithsizelessthanthree[J].AustralJCombin,1991,3:55-73.
  • 8YENChihHung,FUHungLin.Linear2-arboricityofthecompletegraph[J].TaiwaneseJMath,2010,14(1):273-286.
  • 9THOMASSENC.Twocoloringtheedgesofacubicgraphsuchthateachmonochromaticcomponentisapathoflengthatmost5[J].JCombinTheory:SerB,1999,75:100109.
  • 10MAQin,WUJianliang,YUXiao.Planargraphswithout5-cyclesorwithout6-cycles[J].DiscreteMath,2009,309:2998-3005.

二级参考文献14

  • 1BONDY J A, MURTY U S R. Graph theory with applications[M]. New York: MacMillan Press, 1976.
  • 2HABIB M, PEROCHE B. Some problems about linear arboricity[ J ]. Disc Math, 1982, 41:219-220.
  • 3BERMOND J C, FIUQUET J L, HABIB M, et al. On linear k-arboricity [ J ]. Discrete Math. , 1984, 52:123-132.
  • 4JACKSON B, WORMALD N C. On the linear k-arboricity of cubic graphs[ J ]. Disc Math, 1996, 162:293-297.
  • 5ALDRED R E L, WORMALD N C. More on the linear k-arboricity of regular graphs[ J ]. Austral J Combin, 1998, 18:97- 104.
  • 6FU Hung-Lin, HUANG Kuo-Ching. The linear 2-arboricity of complete bipartite graphs[ J ]. Ars Combin, 1994, 38:309-318.
  • 7CHEN Bor-Liang, FU Hung-Lin, HUANG Kuo-Ching. Decomposing graphs into forests of paths with size less than three[ J ]. Austral J Combin, 1991, 3:55-73.
  • 8YEN Chih-Hung, FU Hung-Lin. Linear 2-arboricity of the complete graph[ J]. Taiwan Residents J Math, 2010, 14( 1 ) :273-286.
  • 9THOMASSEN C. Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most [ J ]. Combin Theory. Ser B. 1999. 75:100-109.
  • 10AKIYAMA J. Three developing topics in graph theory [ D]. Tokyo: University of Tokyo, 1980.

共引文献3

同被引文献3

引证文献3

二级引证文献1

山东大学学报（理学版）
2014年 第6期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部