首页 | 本学科首页   官方微博 | 高级检索  
     检索      

D-完全一致混合超图不可着色的一个充要条件
引用本文:郑国彪.D-完全一致混合超图不可着色的一个充要条件[J].纯粹数学与应用数学,2011,27(3):308-312.
作者姓名:郑国彪
作者单位:青海民族大学学报编辑部,青海西宁,810007
基金项目:国家自然科学基金(10861009)
摘    要:混合超图的上,下色数与C-超边和D-超边数有着必然联系.一般地,增加C边会使下色数x(H)增加,增加D-超边会使上色数(x)(H)减小.本论文对D-完全一致混合超图进行研究,利用组合数学中分划思想及方法得到的D-完全一致混合超图不可着色的一个充要条件,对D-完全一致混合超图能否着色找到了可行的依据,进一步揭示C-超边数...

关 键 词:关完全一致混合超图  不可着色  充要条件

A necessary and sufficient condition of D-complete uniform mixed hypergraphs uncolorable
ZHENG Guo-biao.A necessary and sufficient condition of D-complete uniform mixed hypergraphs uncolorable[J].Pure and Applied Mathematics,2011,27(3):308-312.
Authors:ZHENG Guo-biao
Institution:ZHENG Guo-biao(Editer Department of Qinghai Nationalities Institutes,Xining 810007,China)
Abstract: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.
Keywords:the complete uniform mixed hypergraphs  upper chromatic number  lower chromatic number  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号