Artículos de revistas
The total chromatic number of some bipartite graphs
Registro en:
Ars Combinatoria. Charles Babbage Res Ctr, v. 88, n. 335, n. 347, 2008.
0381-7032
WOS:000257486100028
Autor
Campos, CN
de Mello, CP
Institución
Resumen
The total chromatic number X-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 of k-dimensional cubes. 88 335 347