论文标题
张量图的正交着色
Orthogonal Colourings of Tensor Graphs
论文作者
论文摘要
在本文中，研究了张量图的完美K-正交性着色。首先，确定给定图是否具有完美的2-正交着色的问题是张张子图问题。然后，显示出两个图具有完美的$ K $ - 正交着色，那么他们的张量图也是如此。这提供了一般张量图的$ K $ - 正交色编号上的上限。最后，给出了张量图的另外两个条件，具有完美的$ k $ - 正交着色。
In this paper, perfect k-orthogonal colourings of tensor graphs are studied. First, the problem of determining if a given graph has a perfect 2-orthogonal colouring is reformulated as a tensor subgraph problem. Then, it is shown that if two graphs have a perfect $k$-orthogonal colouring, then so does their tensor graph. This provides an upper bound on the $k$-orthogonal chromatic number for general tensor graphs. Lastly, two other conditions for a tensor graph to have a perfect $k$-orthogonal colouring are given.
