期刊文献+

D-完全一致混合超图不可着色的一个充要条件 被引量:4

A necessary and sufficient condition of D-complete uniform mixed hypergraphs uncolorable
下载PDF
导出
摘要 混合超图的上,下色数与C-超边和D-超边数有着必然联系.一般地,增加C边会使下色数χ(H)增加,增加D-超边会使上色数χ(H)减小.本论文对D-完全一致混合超图进行研究,利用组合数学中分划思想及方法得到的D-完全一致混合超图不可着色的一个充要条件,对D-完全一致混合超图能否着色找到了可行的依据,进一步揭示C-超边数与上,下色数之间的关系,给出了完全一致混合超图K(n,l,m)=(X,lX,Xm)在删除若干C-超边后不可着色的一些结论. The upper chromatic number and lower chromatic number of mixed hypergraphs closely relacted with its C-hyperedges and D-hyperedges.In general,adding one C-edges to H can increase χ(H) and adding one D-edge can decrease χ(H),where H is a mixed hypergraph,χ(H) is the lower chromatic number and χ(H) is the upper chromatic number of H.In this artical,taking complete mixed hypergraphs as a example,further uncomer the relation of that between the number of C-hyperedges and D-hyperedges in H and chromatic number of H,and give some results on upper chromatic number and lower chromatic number of uniform mixed hypergraphs H =(X,lX-C0,mX),obtained by deleting some C-hyperedges from complete uniform mixed hypergraphs H =(X,lX,Xm),where C0 is a subset of C.
作者 郑国彪
出处 《纯粹数学与应用数学》 CSCD 2011年第3期308-312,共5页 Pure and Applied Mathematics
基金 国家自然科学基金(10861009)
关键词 关完全一致混合超图 不可着色 充要条件 the complete uniform mixed hypergraphs upper chromatic number lower chromatic number
  • 相关文献

参考文献8

  • 1禹继国,刁科凤,刘桂真.4一致C-超图的最小边数问题[J].山东大学学报(理学版),2003,38(5):56-60. 被引量:5
  • 2Voloshin V I. Coloring Mixed Hypergraphs: Theory, Algorithms and Applications[M]. Rhode Island: American Mathematical Society Providence, 2003.
  • 3Voloshin V I. The mixed hypergraphs[J]. Comput. Sci. J. Moldova, 1993(1):45-52.
  • 4Voloshin V I, Voloshin V Pi. On the Upper Chromatic Number of a Hypergraph[M]. Chisinau: Preprint of Moldova State University, 1992.
  • 5Voloshin V I. On the Upper Chromatic Number of a Hypergraph[M]. Chisinau: Scientific Research Conference of Moldova State University, 1992.
  • 6郑国彪.一类一致混合超图的上、下色数[J].青海师专学报,2007,27(5):18-22. 被引量:4
  • 7郑国彪.关于删除若干C-超边的完全一致混合超图色数的几个结论[J].青海师专学报,2008,28(5):12-15. 被引量:3
  • 8Zheng 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.

二级参考文献3

共引文献5

同被引文献45

  • 1张秉儒.图的伴随多项式的因式分解定理及应用[J].数学学报(中文版),2005,48(1):125-132. 被引量:22
  • 2刘儒英.P_(q-1)的补图的色唯一性[J].Journal of Mathematical Research and Exposition,1994,14(3):469-472. 被引量:39
  • 3刘儒英.求图的色多项式的一种新方法及其应用[J].科学通报,1987,32.
  • 4Vitaly, Voloshin V I. Coloring Mixed Hypergraphs: Theory, Algorithms and Applications[M]. Rhode Island: American Mathematical Society Providence, 2003.
  • 5Voloshin V I. The mixed hypergraphs[J]. Comput. Sci. J. Moldova, 1993(1):45-52.
  • 6Voloshin V I. On the Upper Chromatic Number of a Hypergraph[M]. Chisinau: Preprint of Moldova State University~ 1992.
  • 7郑国彪.一类一致混合超图的上、下色数[J].青海师专学报,2007,27(5):18-22. 被引量:4
  • 8刘儒英.两类图的色多项式的求法[J].科学通报,1987,32:1147-1148.
  • 9Body J A, Murty U S R. Graph Theory with Applications[M]. Amsterdam: North-Holland, 1976.
  • 10Liu R Y. Adjoint polynomials and chromatically unique graphs[J]. Discrete Mathematics, 1997,172:85-92.

引证文献4

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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