An upper bound for the total chromatic number |
| |
Authors: | H R Hind |
| |
Institution: | (1) Department of Pure Mathematics, University of Cambridge, 16 Mill Lane, Cambridge, England |
| |
Abstract: | The total chromatic number,![chi](/content/g2v0080k27png11t/xxlarge967.gif) (G), of a graphG, is defined to be the minimum number of colours needed to colour the vertices and edges of a graph in such a way that no adjacent vertices, no adjacent edges and no incident vertex and edge are given the same colour. This paper shows that
, where (G) is the vertex chromatic number and![chi](/content/g2v0080k27png11t/xxlarge967.gif) (G) is the edge chromatic number of the graph.Partially supported by ORS grant ORS/84120 |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|