矩阵排序在全染色问题中的一点应用

Some Application of Matrix Permutation Method on the Total Colouring Problem

本文定义了k_全着色矩阵及同类矩阵等概念,给出了完全图,完全偶图等的与t(G)_全着色的简易算法.

In this paper, We First definite k-total colouring matrix and same species matrix, at the same time, give computational algorithms of t (G)-total colouring on complete graphs and complete bipartite graphs etc.