期刊文献+

嵌入曲面的特殊图的边染色

Edge colourings of embedded special graphs
下载PDF
导出
摘要 设图G是嵌入到欧拉示性数χ(∑)≥0的曲面∑上的图,χ′(G)和Δ(G)分别表示图G的边色数和最大度.如果△(G)≥4且G满足以下条件:(1)图G中的任意两个三角形T_1,T_2的距离至少是2;(2)图G中i-圈和j-圈的距离至少是1,i,j∈{3,4};(3)图G中没有5-圈,则有Δ(G)=χ′(G). Let G be a graph embedded on a surface ∑ of Euler characteristic x(∑) ≥ 0.x’(G) and △(G) denote the chromatic index and the maximum degree of G,respectively.The paper shows that △(G) = x’(G) if the graph G with △(G) ≥ 4 satisfies the following properties:(1) any two triangles with distance at least two;(2) any i-cycle and j-cycle with distance at least one,i,j ∈ {3,4};(3) G contains no 5-cycles.
作者 孙林 罗朝阳
出处 《运筹学学报》 CSCD 北大核心 2015年第1期125-130,共6页 Operations Research Transactions
基金 新疆自治区高校科研计划项目(Nos.XJEDU2014S067 XJEDU2014I046)
关键词 欧拉示性数 边色数 放电法 Euler characteristic cycles the chromatic index discharging method
  • 相关文献

参考文献9

  • 1Bondy J A, Murty U S R. Graphs Theory with Applications [M]. New York: North-Holland, 1979.
  • 2Vizing V G. Critical graphs with given chromatic class [J]. Diskret Analiz, 1965, 5: 9-17.
  • 3Melnikov L S. The chromatic class and location of a graph on a closed surface [J]. Mat Zametki, 1970, 7: 671-681.
  • 4Hind H, Zhao Y. Edge colorings of graphs embeddable in a surface of low genus [J]. Discrete Math, 1998, 190: 107-114.
  • 5Sanders D, Zhao Y. Planar graphs of maximum degree seven are class 1 [J]. J Combin Theory B, 2001, 83: 201-212.
  • 6Zhang L. Every planar graph with maximum degree 7 is of class 1 [J]. Graphs and Combin, 2000, 16: 467-495.
  • 7Sanders D, Zhao Y. Coloring edges of graphs embedded in a surface of characteristic zero [J]. J Combin Theory B, 2003, 87: 254-263.
  • 8Hou J F, Liu B, Liu G Z, et al. Edge colorings of embedded graphs without 4-cycles or chordal 4-cycles [J]. International Journal of Computer Mathematics, 2010, 87: 2880-2886.
  • 9Vizing V G. Critical graphs with given chromatic class [J]. Diskret Analiz, 1964, 3: 25-30.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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