Title of article :
The total chromatic number of some bipartite graphs
Author/Authors :
Campos، نويسنده , , C.N. and de Mello، نويسنده , , C.P.، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2005
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.
Keywords :
k-dimensional cube , near-ladder , Bipartite graphs , Total chromatic number , total colouring , GRID
Journal title :
Electronic Notes in Discrete Mathematics
Journal title :
Electronic Notes in Discrete Mathematics
