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

C-完全一致混合超图不可着色的充要条件
引用本文:郑国彪.C-完全一致混合超图不可着色的充要条件[J].青海师范大学学报(自然科学版),2011,27(3):1-4.
作者姓名:郑国彪
作者单位:青海民族大学学报编辑部,青海西宁,810007
基金项目:国家自然科学基金资助项目:图的多项式研究及应用(No:10861009)
摘    要:混合超图H′=(X,Xl,mX-D0)(其中D0表示若干恰由X中m个元素组成的D-超边的集合)的着色与其顶点个数有着必然的联系,当顶点个数超过一定数量时,H′便不可着色.本论文给出并证明了这类超图不可正常着色的一个充要条件.这一结论也揭示了这类混合超图可正常着色时,其可拥有的最大顶点个数与它的恰由X中m个元素形成的D-超边的个数之间的关系.

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

A necessary and sufficient condition of C-complete uniform mixed hypergraphs uncolorable
ZHENG Guo-biao.A necessary and sufficient condition of C-complete uniform mixed hypergraphs uncolorable[J].Journal of Qinghai Normal University(Natural Science Edition),2011,27(3):1-4.
Authors:ZHENG Guo-biao
Institution:ZHENG Guo-biao(Editer Department of Qinghai Nationalities Institutes,Xining 810007,China)
Abstract:The mixed hypergraph H'=(X,(Xl),(Xm)-D0)is obtained by deleting some D-hyperedges from the complete uniform mixed hypergraphs κ(n,l,m)=(X,(Xl),(Xm)),where D0 is a subset of(Xm).Its coloring has a certainly relation with the number of its vertices.When its vertice's number is larger than certain number,it is uncolorable.In this artical,author give a necessary and sufficient condition of C-complete Uniform mixed hypergraphs uncolorable.
Keywords:the C-complete uniform mixed hypergraphs  necessary and sufficient condition  uncolorable  
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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