期刊文献+

两类G_t^s(a,b;c,d)图的着色 被引量:1

Coloring of two families of G_t^s(a,b;c,d) graphs
下载PDF
导出
摘要 在综述国内外关于广义多边形树Gst(a,b;c,d)着色研究的基础上,对一些广义多边形树Gst(a,b;c,d)(s+t=2)组成的图类2ξ(a,b;c,d)的着色、色唯一和色等价类等相关问题进行了研究,得到了两类特殊图2ξ(m,m;m,m)(m≥2)和2ξ(a,a;b,b)(a≠b)且min{a,b}≥2是两个色等价类的结论. The correlative problems, which are concerned with the family of graphs £2 (a,b;c,d) composed of some generalized polygon trees G^s t (a, b; c,d) and s+t=2, such as their coloring, chromatic uniqueness, and chromatic equivalence class, were investigated on the basis of summing up the investigation results of coloring of abovementioned polygon trees. It was concluded then that two families of special graphs £2 (m, m; m, m) for m≥2 and £e2 (a, a ; b, b) for a≠b are two chromatic equivalence classes.
出处 《兰州理工大学学报》 CAS 北大核心 2006年第4期149-152,共4页 Journal of Lanzhou University of Technology
基金 陕西省自然科学基金(2004A14)
关键词 广义θ-图 广义多边形树G^s t(a b c d) 色等价类 generalized θ-graph generalized polygon tree G^s t (a, b c, d) chromatic equivalence class
  • 相关文献

参考文献7

  • 1XU S J,LIU J J,PENG Y H. The chromaticity of s-bridge graphs and related graphs [J]. Discrete Mathematics, 1994,135 : 349-358.
  • 2KOH K M,TEO K L. The search of chromatically unique graphs-II [J]. Discrete Mathematics, 1997,172: 59-78.
  • 3PENG Y H. Another family of chromatically unique graphs[J]. Graphs and Combinatorics, 1995,11 : 285-291.
  • 4OMOOMI B,PENG Y H. Chromatic equivalence classes of certain cycles with edges [J]. Discrete Mathematics, 2001,232 :175-183.
  • 5KOHK M,TEO K L. The search for chromatically unique graphs [J]. Graphs and Combinatorics, 1990,6 : 259-285.
  • 6CHAO C Y,ZHAO L C. Chromatic polynomials of a family of graphs [J]. Ars Combinatorics, 1983,15: 111-129.
  • 7LOERINC B. Chromatic Uniqueness of the generalized θ-graph[J]. Discrete Mathematics, 1979,23:313-316.

同被引文献7

  • 1李雪峰.一类K_4-同胚图的色唯一性[J].南昌大学学报(理科版),2006,30(3):215-218. 被引量:3
  • 2KOH K M, TEO K L The search for chromatically unique graph [J]. Graphs Combin, 1990,6: 259-285.
  • 3KOH K M, TEO K I. The search for chromatically unique graphH [J]. Discrete Math, 1997,172: 59-78.
  • 4HARARY F. Graph theory[M]. Addison-Wesley: Reading MA,1969.
  • 5CHAO C Y, ZHAO L C. Chromatic polynomials of a family of graphs [J]. Ars Combin, 1983,15 : 111-129.
  • 6WHITEHEAD JR E G,ZHAO L C. Chromatic uniqueness and equivalence of K4 homeomorphs [J]. Graph Theory, 1984, 8: 355-364.
  • 7李雪峰.一类色唯一的K_1-同胚图[J].安徽大学学报(自然科学版),2008,32(4):18-21. 被引量:4

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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