论文信息 - The total chromatic number of any multigraph with maximum degree five is at most seven - 字舞流文

The total chromatic number of any multigraph with maximum degree five is at most seven

The result announced in the title is proved. A new proof of the total 6-colorability of any multigraph with maximum degree 4 is also given.

Alexandr V. Kostochka | A. Kostochka

[1] H. R. Hind,et al. An upper bound for the total chromatic number , 1990, Graphs Comb..

[2] Roland Häggkvist,et al. An Improvement of Hind's Upper Bound on the Total Chromatic Number , 1996, Combinatorics, Probability and Computing.

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

[4] John Mitchem,et al. Critical Point‐Arboritic Graphs , 1975 .

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

[6] Roland Häggkvist,et al. Some upper bounds on the total and list chromatic numbers of multigraphs , 1992, J. Graph Theory.

[7] Peter Freebody,et al. Research report No. 10 , 1991 .

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

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

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

[11] J. Petersen. Die Theorie der regulären graphs , 1891 .