摘要
以Gn,n+3表示n点n+3边2-连通的图,将图族Gn,n+3分为17种互不同胚的图族,并根据色多项式系数将这些图分为互不色等价的5类.利用相关的色多项式公式以及色等价定理,证明了一类2-连通(n,n+3)-图在一定条件下是色惟一的.
Let Gn,n+3 be the family of 2connected graphs with n vertices and n+3 edges, L.C.Zhao presented that there exist 17 homeomorphic subfamilies in Gn,n+3,and then by the coefficients of their chromatic polynomials divided these subfamilies into five classes which are not chromatically equivalent. On the basis of L.C.Zhao's work, we use the chromatic polynomial formulas of these graphs and chromatically equivalent theorem of Gn,n+3, and it is proves that a class of Gn,n+3 is chromatically unique on certain conditions.
出处
《大连海事大学学报》
CAS
CSCD
北大核心
2003年第3期93-96,共4页
Journal of Dalian Maritime University
