论文信息 - 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 ∆ + 1. c © 1997 John Wiley & Sons, Inc. J Graph Theory 26: 53–59, 1997

Alexandr V. Kostochka | Douglas R. Woodall | Oleg V. Borodin | D. R. Woodall | A. Kostochka | O. Borodin

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

[2] Alexandr V. Kostochka,et al. Total Colourings of Planar Graphs with Large Girth , 1998, Eur. J. Comb..

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

[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] M. Rosenfeld,et al. On the total coloring of certain graphs , 1971 .