期刊文献+

一类弱惟一染色B-超图的构造及其最小点数

About the Construction of a Special Type of Weak Uniquely Colorable B-hypergraph and the Minimum Vertex Number
原文传递
导出
摘要 定义了弱惟一染色B-超图,给出了一种构造弱惟一染色B-超图的方法,称为直角三角形构造法,并讨论了由直角三角形构造法得到的弱惟一染色B-超图的最小点数. A weak uniquely colorable B-hypergraph is defined. A construction which is called Triangle Construction, of weak uniquely colorable B-hypergraphs is given. Moreover, the minimum vertex number of uniquely colorable B-hypergraphs constructed using Triangle Constmction is discussed.
出处 《山东大学学报(理学版)》 CAS CSCD 北大核心 2010年第2期5-9,共5页 Journal of Shandong University(Natural Science)
基金 山东省自然科学基金资助(ZK2009AM013)
关键词 B-超图 严格染色 上色数 弱惟一染色混合超图 直角三角形构造法 B-hypergraph strict coloring upper chromatic number weak uniquely colorable mixed hypergraph Triangle Construction
  • 相关文献

参考文献6

二级参考文献39

  • 1刁科凤,刘桂真.混合超图的染色理论[J].数学进展,2005,34(2):145-154. 被引量:5
  • 2Zsolt Tuza,Vitaly Voloshin. Uncolorable mixed hypergraphs[J]. Discrete Applied Mathematics,2000,99:209~227.
  • 3Tao Jiang,Dhruv Mubayi,Zsolt Tuza,et al.The chromatic spectrum of mixed hypergraphs[J].Graphs and Combinatorics,2002,18(2):309~318.
  • 4Diao Kefeng,Zhao Ping,Zhou Huishan.About the upper chromatic number of a co-hypergraph[J].Discrete Mathematics,2000,220:67~73.
  • 5Lorenzo Milazzo, Zsolt Tuza. Upper chromatic number of steiner triple and quadruple systems[J].Discrete Mathematics,1997,174:247~259.
  • 6L Milazzo,Zs Tuza. Strict colourings for classes of steiner triple systems[J].Discrete Mathematics,1998,182:233~243.
  • 7S Milici, A Rosa,V Voloshin. Colouring steiner systems with specified block colour paterns[J].Discrete Mathematics,2001,240:145~160.
  • 8Vitaly Voloshin.On the upper chromatic number of a hypergraph[J].Australasian Journal of Combinatorics,1995,11:25~45.
  • 9C Berge.Graphs and hypergraphs[M].Amsterdam:North Holland,1973.
  • 10Voloshin V, Zhou H. Pseudo-chordal mixed hypergraphs [J]. Discrete Mathematics, 1999, 202: 239-248.

共引文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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