期刊文献+

1-可嵌入曲面的图的边染色

Edge Colourings of Embedded 1-graphs
原文传递
导出
摘要 一个图称为是1-可嵌入曲面的,当且仅当它可以画在一个曲面上,使得它的任何一条边最多交叉另外一条边.x′(G)和△(G)分别表示图G的边色数和最大度.给定图G是1-可嵌入到欧拉示性数x(∑)≥0的曲面∑上的图.如果△(G)≥8且不含4-圈或者△(G)≥7且围长g(G)≥4,则图G满足等式△(G)=x′(G),其中,g(G)表示图G中最短圈的长度. A graph is 1-embedded on a surface if it can be drawn on the surface so that each edge is crossed by at most one other edge. χ'(G) and △(G) denote the chromatic index and the maximum degree of G, respectively. Let G be l-embedded on a surface of Euler characteristic χ(∑)≥ 0. The paper shows that △(G) = χ'(G) if △(G) ≥ 8 and G contains no 4-cycles or A(G) ≥ 7 and g(G)≥ 4, where, g(G) denotes the length of the shortest cycle in G.
作者 孙林 孙德荣
出处 《应用数学学报》 CSCD 北大核心 2016年第1期12-20,共9页 Acta Mathematicae Applicatae Sinica
基金 新疆维吾尔自治区高校科研计划(XJEDU2014S067)资助项目
关键词 欧拉示性数 4-圈 围长 边色数 放电法 Euler characteristic 4-cycles girth the chromatic index discharging method
  • 相关文献

参考文献12

  • 1Bondy J A, Murty U S R. Graphs theory with applications Ringle G. Ein Sechsfarben problem auf der Kugel. Abh. 107-117.
  • 2New York: North-Holland, 1979 Math. Semin. Univ. Hambg, 1965, 29.
  • 3Zhang X, Wu J L. On edge colorings of 1-planar graphs. Inform Process Lett, 2011, 111(3): 124 -128.
  • 4Zhang X. Class two 1-planar graphs with maximum degree six or seven, arXiv: 1104.4687.
  • 5Zhang X, Liu G Z. On edge colorings of 1-planar graphs without chordal 5-cycles. Ars Combinatoria, 2012, 104(3): 431-436.
  • 6Zhang X, Liu G Z. On edge colorings of 1-planar graphs without adjacent triangles. Inform Process Lett, 2012, 112:138-142.
  • 7Zhang X, Liu G Z. On Edge Colorings of 1-Toroidal Graphs. Acta Mathematica Sinica, English Series, 2013, 29(7): 1421 1428.
  • 8Vizing V G. Critical graphs with given chromatic class. Diskretn. Anal, 1964, 3:25 -30.
  • 9Zhang L. Every planar graph with maximum degree 7 is of Class 1. Graphs and Combin, 2000, 16: 467--495.
  • 10Sanders D, Zhao Y. Planar graphs of maximum degree seven are Class 1. J Combin Theory B, 2001, 83:201-212.

二级参考文献7

  • 1BONDY J A, MURTY U S R. Graph theory with applications [M]. New York: North-Holland, 1976.
  • 2BORODIN O V. Solution of Ringel' s problems on the vertex-face coloring of plane graphs and on the coloring of 1-planar graphs, Diskret. Analiz [J]. 1984, 41:12-26.
  • 3BORODIN O V, KOSTOCHKA A V, RASPAUD A, et al. Acyclic colouring of 1-planar graphsE J]. Discrete Applied Mathematics, 2001, 114:29-41.
  • 4FABRICI I, MADARAS T. The structure of 1-planar graphs [J]. Discrete Mathematics, 2007, 307:854-865.
  • 5SANDERS D P, ZHAO Yue. Planar graphs of maximum degree seven are class I [ J ]. Journal of Combinatorial Theory: Series B, 2002, 83(2):348-360.
  • 6YAP H P. Some topics in graph theory [M]. New York: Cambridge University Press, 1986.
  • 7SANDERS D P, ZHAO Yue. On the size of edge chromatic critical graphs [ J ]. Journal of Combinatorial Theory : Series B, 2002, 86:408-412.

共引文献7

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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