Total colouring regular bipartite graphs is NP-hard

The NP-Completeness of Edge-Coloring

Ian Holyer · SIAM Journal on Computing · 1981 · 1.1K citations

Natural Sciences, Visualization, Color Theory +10

Combinatorial Mathematics and Its Applications.

I. O. · Journal of the American Statistical Association · 1970 · 550 citations

Natural Sciences, Mathematics, Combinatorics +11

SOME UNSOLVED PROBLEMS IN GRAPH THEORY

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

Natural Sciences, Mathematics, Combinatorics +11

NP completeness of finding the chromatic index of regular graphs

Daniel Leven, Zvi Galil · Journal of Algorithms · 1983 · 191 citations

Natural Sciences, Visualization, Combinatorics +6

Determining the total colouring number is np-hard

Abdón Sánchez-Arroyo · Discrete Mathematics · 1989 · 126 citations

Computing, Computer Science, Algorithms +5