Title of article
The total chromatic number of regular graphs of even order and high degree Original Research Article
Author/Authors
Dezheng Xie، نويسنده , , Zhongshi He، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
17
From page
196
To page
212
Abstract
The total chromatic number image of a graph image is the minimum number of colours needed to colour the edges and the vertices of image so that incident or adjacent elements have distinct colours. We show that if image is a regular graph of even order and image, thenimage.
Keywords
Total chromatic number , Total colouring , Total colouring conjecture
Journal title
Discrete Mathematics
Serial Year
2005
Journal title
Discrete Mathematics
Record number
948439
Link To Document