×

zbMATH — the first resource for mathematics

On colouring products of graphs. (English) Zbl 0863.05034
If for two graphs their edge-chromatic number equals the maximum degree among the degrees of their vertices, then the same holds for the product (Cartesian product) of these two graphs. Estimates are given for the total-chromatic number of the product of two graphs.
MSC:
05C15 Coloring of graphs and hypergraphs
PDF BibTeX XML Cite
Full Text: EuDML