solidot新版网站常见问题,请点击这里查看。

Total Colourings of Some Cartesian and Direct Product Graphs. (arXiv:1807.05842v1 [math.CO])

来源于:arXiv
A graph is k-total colourable if there is an assignment of k different colours to the vertices and edges of the graph such that no two adjacent nor incident elements receive the same colour. In this paper, we determine the total chromatic number of some Cartesian and direct product graphs by giving explicit total colourings. In particular, we establish the total chromatic number of the crown graph, which we use to determine the total chromatic number of other various graphs. 查看全文>>