chromatic polynomial

基本解释

There are three important graph polynomials in graph theory, they have a close relationship with each other: chromatic polynomial, Tutte polynomial and flow polynomial.
另外，关于能被色多项式与流多项式所共同确定的图方面的研究还是空白。
We will also find a sort of planar graphs whose number is equal to 4. We will also give the chromatic polynomial of complete -partite graphs and get a combinatory formula.
最后，还对图的染色的方法数进行了研究，利用组合的方法求出了完全部图的颜色多项式，并得到了一个组合数的公式。
The expressions of the chromatic function and the chromatic weight polynomial of a P-graph about a permutation group H are established, de Bruijn s Theorem follows from th.
文中引进了P-图，P-图的色容指标，P-图关于色置换群H的色权多项式以及色对称与全色对称图等概念，建立了色权多项式的计算公式和一系列的组合公式及性质。