期刊文献+

Mycielski图的对策染色数 被引量:5

The Game Chromatic Number of Mycielski Graph
下载PDF
导出
摘要 介绍了一种新的图着色——关于图 G的对策色数 和对策色数χ*g ( G) .确定了 Mycielski图的对策色数 ,并给出了选手 A获胜的对策 .讨论了关于对策染色 To introduce a new coloring of a graph, the definition of the game coloring Ⅱ of graph G and the chromatic number χ * g (G) of a graph are given. In this paper, the chromatic numbers of some graphs are determined and the strategy for the player A to win is given. Further the property of the game chromatic number Ⅱ χ * g (G) is discussed.
作者 刘西奎 李艳
出处 《徐州师范大学学报(自然科学版)》 CAS 2000年第2期24-26,共3页 Journal of Xuzhou Normal University(Natural Science Edition)
关键词 MYCIELSKI图 顶点着色 色对策 对策色数Ⅱ Mycielski graph vertex coloring game chromatic game chromatic number Ⅱ
  • 相关文献

参考文献4

  • 1BodlaenderHL.Onthecomplexityofsomecoloringgame[C].WorkshoponGraphTheoreticalConceptsinComputerScience,1990. 被引量:1
  • 2FaigleU,KernW,KiersteadHA,etal.Onthegamechromaticnumbersofsomeclassesofgraphs[J].ArsCombin,1993,35:143. 被引量:1
  • 3ChenG,SchelpRH,ShreveWE.Anewgamechromaticnumber[J].EJCombin,1997,(18):1. 被引量:1
  • 4BONDYJA MURTYUSR.图论及其应用[M].北京:科技出版社,1984.. 被引量:23

共引文献22

同被引文献18

  • 1Bondy J A,Marty U S R.图论及其应用[M].吴望名,李念祖,吴兰芳,等译.北京:科学出版社,1976.1-30. 被引量:1
  • 2Chen G,Schelp R H,Shreve W E. A new game chromatic number[J]. E J Combin, 1997,18(18):1. 被引量:1
  • 3Bodlaender H L. On the complexity of some coloring game [A]. Proceedings of WG 1990, Workshop on Graph Theoretical Concepts in Computer Science[C]. 1990.35-39. 被引量:1
  • 4Faigle U,Kern W,Kierstead H A,et al. On the game chromatic numbers of some classes of graphs[J]. Ars Combin,1993, (35): 143. 被引量:1
  • 5Zhu Xuding. The game coloring number of planar graphs[J]. J Combin Theory(B). 1999,79(75) :245. 被引量:1
  • 6Chen G, Schelp R H, Shreve W E, A new game chromatic number[J]. E J. Cormbin, 1997, 18(18):1. 被引量:1
  • 7Zhu Xuding. The game coloring number of planar graphs[J]. J Combin Theory(B). 1999,79(75) :245-258. 被引量:1
  • 8Bondy J A, Murty U S R. Graph Theory with Applications[M]. The Macmillan Press, 1976.1-30. 被引量:1
  • 9Bodlaender H L. On the complexity of some coloring game[A]. Proceedings of WG 1990, Workshop on Graph Theoretical Concepts in Computer Science[C]. 1990,35-39. 被引量:1
  • 10Paigle U, Kern W, Kiersteadi H A, Trotter W T. On the game chromatic numbers of some classes of graphs[J].Ars Combin, 1993, (35):143. 被引量:1

引证文献5

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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