Article ID Journal Published Year Pages File Type
9513129 Discrete Mathematics 2005 17 Pages PDF
Abstract
The total chromatic number χT(G) of a graph G is the minimum number of colours needed to colour the edges and the vertices of G so that incident or adjacent elements have distinct colours. We show that if G is a regular graph of even order and δ(G)⩾23|V(G)|+236, thenχT(G)⩽Δ(G)+2.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
The total chromatic number of regular graphs of even order and high degree
Authors
, ,