关于偏序集相关联图的色数On chromatic number of associated graphs of partially ordered set
薛占军;刘三阳;
摘要(Abstract)：
对于每一个含有最小元素0的偏序集(P,≤)可以得到一个与其关联的图G(P).本文主要通过代数的方法研究了所得关联图G(P)的性质,证明了如果G(P)的色数和团数是有限的,那么色数和团数都仅比P的极小素理想的个数大1.
关键词(KeyWords)： 偏序集;色数;团数;理想
基金项目(Foundation): 国家自然科学基金(60974082);; 国家重点实验室综合业务网络基金(ISN02080003)
作者(Authors): 薛占军;刘三阳;
参考文献(References)：
- [1]Beck I.Coloring of a commutative ring[J].J.Algebra,1988,116:208-226.
- [2]Anderson D D,Naseer M.Beck’s coloring of a commutative ring[J].J.Algebra,1993,159:500-514.
- [3]DeMeyer F R,McKenzie T,Schneider K.The zero-divisor graph of a commutative semigroup[J].Semigroup Forum,2002,65:206-214.
- [4]DeMeyer F R,DeMeyer L.Zero-divisor graphs of semigroups[J].J.Algebra,2005,283:190-198.
- [5]Wu T S,Liu Q,Chen L.Zero-divisor semigroups and refinements of a star graph[J].Discrete Math.,2009,309:2510-2518.
- [6]Lu D C,Wu T S.On bipartite zero-divisor graphs[J].Discrete Math.,2009,309:755-762.
- [7]LaGrange J D.Complemented zero-divisor graphs and Boolean rings[J].J.Algebra,2007,315:600-611.
- [8]Redmond S P.On zero-divisor graphs of small finite commutative rings[J].Discrete Math.,2007,307:11551166.
- [9]West D B.Introduction to Graph Theory[M].2nd ed.New York:Prentice Hall,2001.
- [10]Davey B A,Priestley H A.Introduction to Lattices and Order[M].New York:Cambridge University Press,2002.
- [11]Tverberg H.On Dilworth’s decomposition theorem for partially ordered sets[J].J.Combinatorial Theory,1967(3):305-306.