论文信息 - Total colorings of planar graphs with large maximum degree - 字舞流文

Total colorings of planar graphs with large maximum degree

It is proved that a planar graph with maximum degree Δ ≥ 11 has total (vertex-edge) chromatic number $Delta; + 1. © 1997 John Wiley & Sons, Inc. J Graph Theory 26: 53–59, 1997

Alexandr V. Kostochka | Douglas R. Woodall | Oleg V. Borodin

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

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

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

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

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

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