具有最小连通点对图的C-超图的染色讨论  

On the coloring of C-hypergraphs with minimum connected pair graphs

作　　者：刁科凤[1] 赵平[1] 

机构地区：[1]临沂师范学院数学系,山东临沂276005

出　　处：《山东大学学报（理学版）》2007年第2期56-58,63,共4页Journal of Shandong University(Natural Science)

基　　金：国家自然科学基金资助项目(10471078);教育部博士点基金资助项目(2004042204)

摘　　要：主要讨论C-超图的染色与点的点对图的连通性之间的关系,证明了对任意给定的不小于3的正整数n,都存在上色数为n且具有最小连通点对图的3一致C-超图.The upper （lower） chromatic number X^-, （H） of a mixed hypergraph H= （X, L .D ） is the maximum （minimum） number of colors that can be assigned to the vertices of H in such a way that each C-edgecontains a monochromatic pair of vertices and each D-edge has two vertices colored differently. The upper （lower） chromatic number of a mixed hypergraph is closely related to the number of edges, and the number of edges is closely related to the connectness of the pair graphs of its vertices. The relationship between the coloring and the connectness of the pair graphs of its vertices of a C-hypergraph is discussed, and it is proved that for any positive integer n（w≥3）, there exists a 3-uniform C-hypergraph with upper chromatic number n and minimum connectedpair graphs.

关 键 词：混合超图 严格染色 上色数 点对图 

分 类 号：O157.5[理学—数学]