外平面图的松弛竞赛色数

The relaxed game chromatic number of outplanar graph

下载PDF

导出

摘要主要研究外平面图的松驰竞赛色数。如果缺陷度d =2 ,3 ,4 ,k =7-d ,我们能够分别给Alice一个策略 ,使得对 (k ,d) 松弛染色竞赛Alice能赢。 This paper studies the relaxed game chromatic number of outplanar graph.It is proved that if G is an outplanar graph,then for d=2,3,4,and k=7-d,Alice has a winning strategy for the (k,d)-relaxed coloring game for G.

作者何文杰马俊霞邵泽玲许燕米洪海

机构地区河北工业大学

出处《河北省科学院学报》 CAS 2002年第4期193-197,207,共6页 Journal of The Hebei Academy of Sciences

关键词松驰竞赛色数外平面图图论染色规则缺陷度 (k d)-松驰染色竞赛 Game chromatic number Relaxed game chromatic number Outer-planar graph

分类号 O157.5 [理学—数学]

引文网络
相关文献

参考文献18

1H.Bodlender.On the complexity of some coloring game[J].International Journal of Foundations of Computer Science 1991,(2):133-148. 被引量：1
2P.Boiro,E.Sopena and L.Vignal.Acyclic improper coloring of graphs[J].J Graph Theory,1999,32,97-107. 被引量：1
3L.Cai and X.Zhu.Game Chromatic index of κ-degenerate graphs[J].J Graph Theory,to appear. 被引量：1
4J.Chou,W.Wang and X.Zhu,Relaxed game chromatic number of graphs,Discrete Mathematics,to appear. 被引量：1
5C Chou,W Wang and X Zhu.Relaxed game chromatic number of graphs[M].Manuscript,2001. 被引量：1
6L Cowen,R.Cowen and D.Woodall,Defective colorings of graphs in surfaces:Partitions into subgraphs of bounded valency,T[J].Graph Theory,1986,10:187-195.(下转第207页)文章编号:1001-9383(2002)04-0198-06 被引量：1
7L Cowen,W Golddard and C Jesurum.Defective coloring revesited[J].J Graph Theory,1997,24:205-219. 被引量：1
8W Deuber and X.Zhu.Relaxed coloring of a graph[J].Graphs and Combinatories,1998,14:121-130. 被引量：1
9T Dinski and X.Zhu.A bound for the game chromatic number of graphs.Discrete Math.1999,196:109-115. 被引量：1
10Charles Dunn and H.A.Kierstead.A simple competitive graph coloring algo-rithm[J].J.Combin Theory B,to appear. 被引量：1

1何文杰,许燕,马俊霞,邵泽玲,米洪海.森林的松弛竞赛色数[J].河北省科学院学报,2003,20(1):1-4.

河北省科学院学报

2002年第4期

浏览历史

内容加载中请稍等...

外平面图的松弛竞赛色数

参考文献18

相关作者

相关机构

相关主题

浏览历史