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

广义r-部完全超图的边色数
引用本文:王娜,张雁楠,蔡俊亮,陈星.广义r-部完全超图的边色数[J].北京师范大学学报(自然科学版),2018,54(2):165-171.
作者姓名:王娜  张雁楠  蔡俊亮  陈星
作者单位:北京师范大学数学科学学院,100875,北京;新疆师范高等专科学校数理学院,830043,新疆乌鲁木齐;北京师范大学数学科学学院,100875,北京;新疆工程学院,830091,新疆乌鲁木齐
基金项目:国家自然科学基金资助项目(11301452;11371133),自治区高校科研计划资助项目(XJEDU2016S097)
摘    要:研究了广义r-部完全超图的边色数的问题.在r-部完全超图与t-一致完全超图的着色基础上,确定一类特殊的广义r-部完全超图的边色数,对一般的广义r-部完全超图的边色数给出了上界,推广了r-部完全超图与t-一致完全超图的着色结论. 

关 键 词:r-部完全超图  t-一致完全超图  r-广义部完全超图  边色数
收稿时间:2017-04-10

The edge coloring number of generalized complete r-partitioned hypergraph
WANG Na,ZHANG Yannan,CAI Junliang,CHEN Xing.The edge coloring number of generalized complete r-partitioned hypergraph[J].Journal of Beijing Normal University(Natural Science),2018,54(2):165-171.
Authors:WANG Na  ZHANG Yannan  CAI Junliang  CHEN Xing
Abstract:A hypergraph H is said to be a generalized complete r-partitioned hypergraph, denoted by Kt1,to,…,tn1,n2,…n, If its vertex set X endows with a partition X1, X2,…,Xr, i. e., for all i≠j,Xi∩Xj=()(1≤I,j≤ r), X=∪i=1 Xi.|Xi|=ni(1≤i≤r). The edge set E consists of all distinct subsets E' of X such that |E'∩ Xi|= ti(l≤ti≤ni,l≤i≤r). This article considers the edge coloring number of generalized complete r-partitioned hypergraph. Based on the edge coloring of complete r-partite hypergraph and complete t-uniform hypergraph, the edge chromatic number of special generalized complete r-partitioned hypergraph has been found. The upper bound on the edge chromatic number of generalized complete r-partitioned hypergraph is given, which extends edge chromatic number in complete r-partite hypergraph and complete t-uniform hypergraph.
Keywords:
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《北京师范大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《北京师范大学学报(自然科学版)》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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