论文信息 - The Determination of the Total Chromatic Number of Series-Parallel Graphs with (G) ≥ 4

The Determination of the Total Chromatic Number of Series-Parallel Graphs with (G) ≥ 4

The total chromatic number of series-parallel graphs of maximum degree greater than or equal to 4 will be determined using the double inductions and the method of exchanging colors from the aspect of configuration property. Thus, the result of paper [7] is a special case of this paper.

Shu-Dong Wang | Shan-Chen Pang

[1] J Hang,et al. THE TOTAL CHROMATIC NUMBER OF SOME GRAPHS , 1988 .

[2] R. Duffin. Topology of series-parallel networks , 1965 .

[3] J. A. Bondy,et al. Graph Theory with Applications , 1978 .

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

[5] H. Yap. Some Topics in Graph Theory , 1986 .

[6] Paul D. Seymour,et al. Colouring series-parallel graphs , 1990, Comb..

[7] Béla Bollobás,et al. List-colourings of graphs , 1985, Graphs Comb..

[8] Jianliang Wu,et al. The Linear Arboricity of Series-Parallel Graphs , 2000, Graphs Comb..

[9] J. A. Bondy,et al. Graph Theory with Applications , 1978 .

[10] Jürgen Eckhoff. The maximum number of triangles in a K4-free graph , 1999, Discret. Math..