期刊文献+

最大度是6的平面图是第一类图的一个充分条件 被引量:1

A sufficient condition for a planar graph of maximum degree six to be class 1
下载PDF
导出
摘要 用χ′(G)表示G的边染色数.对于最大度是Δ的可平面图G,如果χ′(G)=Δ,称G为第一类图;如果χ′(G)=Δ+1,称G为第二类图.运用Discharge方法证明:最大度是6且不含7圈的可平面图G是第一类图. Let G be a planar graph of maximum degree Δ,G is said to be class 1 if χ′(G)=Δ and class 2 if χ′(G)=Δ+1,where χ′(G) denotes the chromatic index of G.By applying a discharging method,it is proved that every simple planar graph G with Δ=6 is of class 1,if G contains no any 7-cycle.
出处 《徐州师范大学学报(自然科学版)》 CAS 2011年第2期17-21,共5页 Journal of Xuzhou Normal University(Natural Science Edition)
基金 宿州学院教授基金资助项目(2009JB02)
关键词 平面图 边染色 最大度 planar graph edge coloring maximum degree cycle
  • 相关文献

参考文献7

  • 1Vizing V G. On an estimate of the chromatic index of a p-graph [J]. Diskret Analiz,1964,3(1) :25.
  • 2Vizing V G. Critical graphs with given chromatic class [J]. Diskret Analiz, 1965,5(1) : 9.
  • 3Zhang Liming. Every planar graph with tnaximum de- gree 7 is of class 1[J]. Graphs Combin, 2000, 16 (4) :467.
  • 4Sanders D P,Zhao Yue. Planar graphs of maximum de- gree seven are class l[J]. J Combin Theo..Ser B,2001, 83(2) :201.
  • 5Zhou Guofei. A note on graphs of class l[J]. Discrete Math,2003,262(1/2/3):339.
  • 6Bu Yuehua, Wang Weifan. Some sufficient conditions for a planar graph of maximum degree six to be class 1 [J]. Discrete Math, 2006,306 (13) :1440.
  • 7Li Xuechao, Luo Rong. Edge coloring of embedded graphs with large girth[J]. Graphs Combin, 2003,19 (3) :393.

同被引文献7

  • 1VIZING V G. On an estimate of the chromatic index of a p-graph[J].Diskret Analiz,1964,(01):25-30.
  • 2VIZING V G. Critical graphs with given chromatic class[J].Diskret Analiz,1965,(05):9-17.
  • 3ZHANG Liming. Every planar with maximum degree 7 is of class 1[J].Graphs and Combinatorics,2000,(04):467-495.
  • 4SANDERS D P,ZHAO Yue. Planar graphs of maximum degree seven are class 1[J].Journal of Combinatorial Theory Series B,2001,(02):201-212.
  • 5ZHOU Guofei. A note on graphs of class 1[J].Discrete Mathematics,2003,(1-3):339-345.
  • 6BU Yuehua,WANG Weifan. Some sufficient conditions for a planar graph of maximum degree six to be class 1[J].Discrete Mathematics,2006,(13):1440-1445.
  • 7LI Xuechao,LUO Rong. Edge coloring of embedded graphs with large girth[J].Graphs and Combinatorics,2003,(03):393-401.

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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