Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable

SOME UNSOLVED PROBLEMS IN GRAPH THEORY

V. G. Vizing · Russian Mathematical Surveys · 1968 · 436 citations

Natural Sciences, Mathematics, Combinatorics +11

List Edge and List Total Colourings of Multigraphs

O. V. Borodin, Alexandr Kostochka, Douglas R. Woodall · Journal of Combinatorial Theory Series B · 1997 · 248 citations

Natural Sciences, Visualization, Combinatorics +11

On the total coloring of certain graphs

Moshe Rosenfeld · Israel Journal of Mathematics · 1971 · 142 citations

Natural Sciences, Mathematics, Combinatorics +8

On Total Chromatic Number of a Graph

N. Vijayaditya · Journal of the London Mathematical Society · 1971 · 129 citations

Natural Sciences, Visualization, Combinatorics +4

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

Alexandr Kostochka · Discrete Mathematics · 1996 · 123 citations

Natural Sciences, Mathematics, Combinatorics +4