| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9514617 | Electronic Notes in Discrete Mathematics | 2005 | 5 Pages |
Abstract
The total chromatic number ÏT(G) is the least number of colours needed to colour the vertices and edges of a graph G such that no incident or adjacent elements (vertices or edges) receive the same colour. This work determines the total chromatic number of grids, particular cases of partial grids, near-ladders, and k-dimensional cubes.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
C.N. Campos, C.P. de Mello,