【摘要】 利用全着色矩阵给出一类图的全着色构造,证明了对于这些图类M.Behzad的全着色猜想是正确的,并以实例说明了该方法的应用和推广·由等价命题、定理及其推论可知:证明全着色猜想问题可转化为解决全着色矩阵的存在问题,因此构造出n阶全着色矩阵,就能得到一些图的全着色构造·更多还原

【Abstract】 M.Behzads total colouring conjecture is proved here for a category of graphs by use of a total colouring structure given by a total colouring matrix supposed. An example is also given to illustrate the application and generalization of the method. It is known through equivalent proposition, theorems and relevant inferences that the proof of the total colouring conjecture can be transformed into an existential proposition of total colouring matrix. Therefore, the total colouring structure can be obtained for a category of graphs if an n order total colouring matrix is constituted.更多还原