期刊文献+

关于删除若干C-超边的完全一致混合超图色数的几个结论 被引量:3

Some Results on Chromatic Number of Uniform mixed Hypergraphs Obtained by Deleting Some C-hyperedges from a Complete Uniform Mixed Hypergraphs
下载PDF
导出
摘要 混合超图的上、下色数与C-超边和D-超边数有着必然联系.一般地,增加C-超边会使下色数χ(H)增加,增加D-超边会使上色数-χ(H)减小.本论文以完全混合超图为例,进一步揭示C-超边数与上、下色数之间的关系,给出了完全一致混合超图κ(n,l,m)=(X,(Xl),(X在删除若干C-超边后其上、下色数的若干结论. The upper chromatic number and lower chromatic number of mixed hypergraphs closely relacted with its C - hyperedgos and D -hyperedges. In general,adding one C -edges to can increase χ(£) and adding one D-edge can decrease ^-χ(£) ,where is a mixed hypergraph,χ(£) is the lower chromatic number and ^-χ(£) is the upper chromatic number of £. In this artical ,taking complete mixed hypergraphs as a example, further uncome the relation of that between the number of C - byperedges and D-hyperedges in £ and chromatic number of £, and give some results on upper chromatic unmber and lower chromatic number of uniform mixed hypergraphs £^1= ( X, (X/l)-C0, (X/m) ), obtained by deleting some C - hyperedges from complete uniform mixed hypergraphs = (X,(X/l),(X/m)), where Co is a subset of C.
作者 郑国彪
出处 《青海师专学报》 2008年第5期12-15,共4页 Journal of Qinghai Junior Teachers' College
关键词 完全一致混合超图 上色数 下色数 The complete uniform mixed hypergraphs upper chromatic number lower chromatic unmber
  • 相关文献

参考文献2

二级参考文献2

  • 1Tao Jiang,Dhruv Mubayi,Zsolt Tuza,Vitaly Voloshin,Douglas B. West. The Chromatic Spectrum of Mixed Hypergraphs[J] 2002,Graphs and Combinatorics(2):309~318
  • 2禹继国,刁科凤,刘桂真.4一致C-超图的最小边数问题[J].山东大学学报(理学版),2003,38(5):56-60. 被引量:5

共引文献5

同被引文献17

  • 1Voloshin V I. Coloring Mixed Hypergraphs: Theory, Algorithms and Applications[M]. Rhode Island: American Mathematical Society Providence, 2003.
  • 2Voloshin V I. The mixed hypergraphs[J]. Comput. Sci. J. Moldova, 1993(1):45-52.
  • 3Voloshin V I, Voloshin V Pi. On the Upper Chromatic Number of a Hypergraph[M]. Chisinau: Preprint of Moldova State University, 1992.
  • 4Voloshin V I. On the Upper Chromatic Number of a Hypergraph[M]. Chisinau: Scientific Research Conference of Moldova State University, 1992.
  • 5Zheng G. The minimum number of polychromatic C-hyperedges of the complete uniform imxed hyperfgraphs under one special condetion[J]. Scientia Magna, 2009,5(4):65-75.
  • 6Vitaly, Voloshin V I. Coloring Mixed Hypergraphs: Theory, Algorithms and Applications[M]. Rhode Island: American Mathematical Society Providence, 2003.
  • 7Voloshin V I. The mixed hypergraphs[J]. Comput. Sci. J. Moldova, 1993(1):45-52.
  • 8Voloshin V I. On the Upper Chromatic Number of a Hypergraph[M]. Chisinau: Preprint of Moldova State University~ 1992.
  • 9郑国彪.一类一致混合超图的上、下色数[J].青海师专学报,2007,27(5):18-22. 被引量:4
  • 10Vitaly I. Voloshin,Coloring. Mixed Hypergraphs : Theory, Algorithms and Applications, AmericanMathematical Society Providence, Rhode Island,2003.

引证文献3

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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