论文信息 - Total Colourings of Planar Graphs with Large Girth

Total Colourings of Planar Graphs with Large Girth

It is proved that ifGis a planar graph with total (vertex?edge) chromatic number ??, maximum degree ? and girthg, then ??=?+1 if ??5 andg?5, or ??4 andg?6, or ??3 andg?10. These results hold also for graphs in the projective plane, torus and Klein bottle.

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

[2] H. Yap. Total Colourings of Graphs , 1996 .

[3] M. Rosenfeld,et al. On the total coloring of certain graphs , 1971 .

[4] Alexandr V. Kostochka,et al. The total coloring of a multigraph with maximal degree 4 , 1977, Discret. Math..

[5] Alexandr V. Kostochka,et al. The total chromatic number of any multigraph with maximum degree five is at most seven , 1996, Discret. Math..

[6] Alexandr V. Kostochka,et al. List Edge and List Total Colourings of Multigraphs , 1997, J. Comb. Theory B.

[7] Oleg V. Borodin,et al. On the total coloring of planar graphs. , 1989 .

[8] Alexandr V. Kostochka,et al. Total colorings of planar graphs with large maximum degree , 1997, J. Graph Theory.

[9] N. Vijayaditya. On Total Chromatic Number of a Graph , 1971 .

[10] Tommy R. Jensen,et al. Graph Coloring Problems , 1994 .