The adjacent vertex distinguishing total chromatic number

Abstract 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 set 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 Δ ( G ) + C colours.

[1]  Richard H. Schelp,et al.  Vertex-distinguishing proper edge-colorings , 1997, Journal of Graph Theory.

[2]  Jonathan Hulgan,et al.  Concise proofs for adjacent vertex-distinguishing total colorings , 2009, Discret. Math..

[3]  Jianfang Wang,et al.  Adjacent strong edge coloring of graphs , 2002, Appl. Math. Lett..

[4]  Béla Bollobás,et al.  Random Graphs , 1985 .

[5]  Haiying Wang,et al.  On the adjacent vertex-distinguishing total chromatic numbers of the graphs with Δ (G) = 3 , 2007, J. Comb. Optim..

[6]  Xiangen Chen.  On the adjacent vertex distinguishing total coloring numbers of graphs with Delta=3 , 2008, Discret. Math..

[7]  V. G. Vizing.  SOME UNSOLVED PROBLEMS IN GRAPH THEORY , 1968 .

[8]  B. Yao,et al.  On adjacent-vertex-distinguishing total coloring of graphs , 2005 .

[9]  Zsolt Tuza,et al.  Irregular assignments and vertex-distinguishing edge-colorings of graphs , 1990 .

[10]  Bruce A. Reed,et al.  A Bound on the Total Chromatic Number , 1998, Comb..

[11]  R. Schelp,et al.  Vertex-distinguishing proper edge-colorings , 1997 .

[12]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[13]  Colin McDiarmid,et al.  Concentration for self-bounding functions and an inequality of Talagrand , 2006 .

[14]  M. Talagrand.  New concentration inequalities in product spaces , 1996 .

[15]  Richard H. Schelp,et al.  Adjacent Vertex Distinguishing Edge-Colorings , 2007, SIAM J. Discret. Math..

[16]  Qiang,et al.  An Upper Bound for the Adjacent Vertex-Distinguishing Total Chromatic Number of a Graph , 2009 .

[17]  M. Talagrand.  Concentration of measure and isoperimetric inequalities in product spaces , 1994, math/9406212.

[18]  Hamed Hatami,et al.  Delta+300 is a bound on the adjacent vertex distinguishing edge chromatic number , 2005, J. Comb. Theory, Ser. B.

[19]  P. Erdos-L Lovász.  Problems and Results on 3-chromatic Hypergraphs and Some Related Questions , 2022 .

[20]  Jonathan Hulgan.  Graph colorings with constraints , 2010 .