The adjacent vertex distinguishing total chromatic number

Details The adjacent vertex distinguishing total chromatic number The adjacent vertex distinguishing total chromatic number

2010-09-09

arxiv.org/abs/1009.1785v2

Mathematics

Combinatorics

Scientific paper

A well-studied concept is that of the total chromatic number. A proper total colouring of a graph is a colouring of both vertices and edges so that every pair of adjacent vertices receive different colours, every pair of adjacent edges receive different colours and every vertex and incident edge receive different colours. This paper considers a strengthening of this condition and examines the minimum number of colours required for a total colouring with the additional property that for any adjacent vertices $u$ and $v$, the sets of colours incident to $u$ is different from the set of colours incident to $v$. It is shown that there is a constant $C$ so that for any graph $G$, there exists such a colouring using at most $\Delta(G) + C$ colours.

Affiliated with

Also associated with

No associations

Rating

The adjacent vertex distinguishing total chromatic number does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The adjacent vertex distinguishing total chromatic number, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The adjacent vertex distinguishing total chromatic number will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-559193