Concepedia
Discrete Mathematics · 2012 · 15 citations · 10 references
Natural SciencesMathematicsCombinatoricsDiscrete MathematicsGraph ColoringGraph TheoryMatroid TheoryChromatic Polynomials
10
Determining the total colouring number is np-hard
Abdón Sánchez-Arroyo · Discrete Mathematics · 1989 · 126 citations
Computing, Computer Science, Algorithms +5
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
The Colour Numbers of Complete Graphs
Mehdi Behzad, Gary Chartrand, Jeff Cooper · Journal of the London Mathematical Society · 1967 · 100 citations
Natural Sciences, Mathematics, Combinatorics +5
On the compatibility between a graph and a simple order
Fred S. Roberts · Journal of Combinatorial Theory Series B · 1971 · 76 citations
Computing, Computer Science, Mathematics +8
Total colouring regular bipartite graphs is NP-hard
Colin McDiarmid, Abdón Sánchez-Arroyo · Discrete Mathematics · 1994 · 70 citations
Natural Sciences, Mining Engineering, Combinatorics +7