期刊文献+

不含短圈平面图的强边染色

Strong Edge Coloring of Planar Graphs without Short Cycles
下载PDF
导出
摘要 图G的强边染色是在正常边染色的基础上,要求距离不超过2的任意两条边染不同的颜色。强边染色所用颜色的最小整数称为图G的强边色数。文章首先给出极小反例的构型,然后通过权转移方法,证明了3-圈、4-圈互不相交且没有k-圈(5≤k≤10)的平面图的强边色数至多是3Δ(G)+1.
作者 张恒
出处 《应用数学进展》 2018年第6期661-666,共6页 Advances in Applied Mathematics
关键词 平面图 强边染色 强边色数 Planar Graphs Strong Edge Coloring Strong Edge Chromatic Number Cycle
  • 相关文献

参考文献2

二级参考文献17

  • 1BONDY J A, MURTY U S R. Graph theory with applications[M]. London: Macmillan, 1976.
  • 2ANDERSEN L D. The strong chromatic index of a cubic graph is at most 10[J]. Discrete Mathematics, 1992, 108:231-252.
  • 3HORáK P, HE Qing, TROTTER W T. Induced matchings in cubic graphs[J]. Graph Theory, 1993, 17(2):151-160.
  • 4CRANSTON D. Strong edge-coloring graphs with maximum degree 4 using 22 colors[J]. Discrete Mathematics, 2006, 306:2772-2778.
  • 5FAUDREE R J, GYSRFAS A, SCHELP R H, et al. The strong chromatic index of graphs[J]. Ars Combin, 1990, 29B:205-211.
  • 6BORODIN O V, IVANOVA A O. Precise upper bound for the strong edge chromatic number of sparse planar graphs[J]. Discuss Math Graph Theory, 2013, 33:759-770.
  • 7MONTASSIER M, PêCHER A, RASPAUD A. Strong chromatic index of planar graphs with large girth[J]. Graph Theory and Applications, CRM Series, 2013, 16:265-270.
  • 8HUDáK D, LU?AR B, SOTáK R, et al. Strong edge-coloring of planar graphs[J]. Discrete Mathematics, 2014, 324:41-49.
  • 9BENSMAIL J, HARUTYUNYAN A, HOCQUARD H, et al. Strong edge-coloring of sparse planar graphs[J]. Discrete Applied Mathematics, 2014, 179:229-234.
  • 10Andersen L D. The strong chromatic index of a cubic graph is at most 10[J]. Discrete Mathematics, 1992, 108: 231-252.

共引文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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