A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
A new upper bound for total colourings of graphs
1995
Discrete Mathematics
We give a new upper bound on the total chromatic number of a graph. This bound improves the results known for some classes of graphs. The bound is stated as follows: ZT ~< Z~ + L l3 ~ J + 2, where Z is the chromatic number, Z~ is the edge chromatic number (chromatic index) and ZT is the total chromatic number.
doi:10.1016/0012-365x(94)00219-9
fatcat:4hruj5izt5h7tlcfinnred3rby