|
Repositorio Atenea de la Facultad de Ciencias, UNAM >
Repositorio Ciencias >
FACULTAD DE CIENCIAS >
Ciencias >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11154/3429
|
| Title: | A NEW UPPER BOUND FOR TOTAL COLORINGS OF GRAPHS |
| Authors: | SánchezARROYO, A |
| Issue Date: | 1995 |
| Abstract: | 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: chi(T) less than or equal to chi(e) + [1/3 chi]+2 where chi is the chromatic number, chi(e) is the edge chromatic number (chromatic index) and chi(T) is the total chromatic number. |
| URI: | http://hdl.handle.net/11154/3429 |
| ISSN: | 0012-365X |
| Appears in Collections: | Ciencias
|
Files in This Item:
There are no files associated with this item.
|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
|
