期刊文献+

1-平面图的线性荫度(英文) 被引量:8

On the Linear Arboricity of 1-Planar Graphs
下载PDF
导出
摘要 证明了最大度△≥33的1-平面图的线性荫度为[△/2] It is proved that the linear arboricity of every 1-planar graph with maxi- mum degree △ ≥ 33 is [△/2].
出处 《运筹学学报》 CSCD 2011年第3期38-44,共7页 Operations Research Transactions
基金 National Natural Science Foundation of China(10971121,11101243,61070230) The Research Fund for the Doctoral Program of Higher Education(20100131120017) Graduate Independent Innovation Foundation of Shandong University(yzc10040)
关键词 1-平面图 1-嵌入图 线性荫度 1-planar graph, 1-embedded graph, linear arboricity
  • 相关文献

参考文献18

  • 1Bondy J A, Murty U S R. Graph Theory with Applications [M]. New York: North-Holland, 1976.
  • 2Akiyama J, Exoo G, Haraxy F. Covering and packing in graphs Ⅲ: Cyclic and acyclic invariants [J]. Math Slovaca, 1980, 30: 405-417.
  • 3Wu J L. On the linear arboricity of planar graphs [J]. J. Graph Theory, 1999, 31: 129-134.
  • 4Wu J L, Wu Y. The linear arboricity of planar graphs of maximum degree seven is four [J]. J. Graph Theory, 2008, 58: 210-220.
  • 5Peroche B. Complexity of the linear arboricity of a graph [J]. RAIRO Rech. Oper., 1982, 16: 125-129.
  • 6Wu J L. The linear arboricity of graphs on surfaces of negative Euler characteristic [J]. SIAM J Discrete Math, 2008, 23(1): 54-58.
  • 7Wu J L. The linear arboricity of series-parallel graphs [J]. Graphs Combin, 2000, 16: 367-372.
  • 8Ringel G. Ein sechsfarbenproblem auf der kugel [J]. Abh. Math. Semin. Univ. Hamburg, 1965, 29: 107-117.
  • 9Borodin O V. Solution of Ringel's problems on the vertex-face coloring of plane graphs and on the coloring of 1-planar graphs [J]. Metody Diskret Analiz, 1984, 41: 12-26.
  • 10Borodin O V. A New Proof of the 6-Color Theorem [J]. J Graph Theory, 1995, 19(4): 507-521.

同被引文献17

引证文献8

二级引证文献17

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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