期刊文献+

第一类平面图的一个充分条件 被引量:3

A sufficient condition for a planar graph to be of class 1
在线阅读 下载PDF
导出
摘要 对于最大度为5的平面图,既有第一类,也有第二类.运用Discharge方法以及临界图的一些重要性质证明了:每个最大度为5且不含相交三角形的简单平面图的边色数等于5,即这样的平面图是第一类的.因此,给出了最大度为5的平面图分类的一个特征刻画. Both class 1 and class 2 planar graph exist in planar graphs with △≤5 . It was proved that the chromatic index of every simple planar graph G with △= 5 and without intersecting triangles equaled to 5, i. e,such planar graphs were of class 1, where △ denoted the maximum degree of G.
出处 《浙江师范大学学报(自然科学版)》 CAS 2007年第4期416-420,共5页 Journal of Zhejiang Normal University:Natural Sciences
基金 国家自然科学基金资助项目(10471131)
关键词 平面图 边染色 三角形 最大度 planar graph edge coloring triangle maximum degree
  • 相关文献

参考文献7

  • 1Vizing V G.On an estimate of the chromatic index of a p-graph[J].Diskret Analiz,1964,3 (1):25-30.
  • 2Vizing V G.Critical graphs with given chromatic class[J].Diskret Analiz,1965,5 (1):9-17.
  • 3Sanders D P,Zhao Yue.Planar graphs of maximum degree seven are class Ⅰ[J].J Combin Theory Ser B,2001,83(2):201-212.
  • 4Zhang Liming.Every planar with maximum degree 7 is of class 1[J].Graphs Combin,2000,16 (4):467 -495.
  • 5Zhou Guofei.A note on graphs of class 1[J].Discrete Math,2003,262 (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 Math,2006,306(13):1440-1445.
  • 7Li Xuechao,Luo Rong.Edge coloring of embedded graphs with large girth[J].Graphs Combin,2003,19 (3):393-401.

同被引文献26

  • 1Vizing V G.On an estimate of the chromatic index of a p-graph[J].Diskret Analiz,1964,3(1):25-30.
  • 2Vizing V G.Critical graphs with given chromatic class[J].Diskret Analiz,1965,5(1):9-17.
  • 3Sanders D P,Zhao Y.Planar graphs of maximum degree seven are class 1[J].J Combin Theory Ser B,2001,83(2):201-212.
  • 4Zhang L.Every planar with maximum degree 7 is of class 1[J].Graphs Combin,2000,16(4):467-495.
  • 5Zhou G.A note on graphs of class 1[J].Discrete Math,2003,262(1/3):339-345.
  • 6Bu Y,Wang W.Some sufficient conditions for a planar graph of maximum degree six to be class 1[J].Discrete Math,2006,306(13):1440-1445.
  • 7Li X,Luo R.Edge coloring of embedded graphs with large girth[J].Graphs Combin,2003,19(3):393-401.
  • 8Lam P,Liu J,Shu W,et al.Some sufficient conditions for a planar graph to be of class1[J].Congr Numer,1999,136(1):201-205.
  • 9VIZING V G. On an estimate of the chromatic index of a p-graph[J]. Diskret Analiz, 1964(3): 25-30.
  • 10VIZING V G. Critical graphs with given chromatic class[J]. Diskret Analiz 1965(5): 9-17.

引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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