The total coloring conjecture, independently proposed by Behzad and Vizing, states that if 
is the maximum vertex degree of a finite
simple graph 
, then its total chromatic
number 
satisfies
 |
Total Coloring Conjecture
See also
Total Chromatic Number, Total GraphExplore with Wolfram|Alpha
References
Behzad, M. "Graphs and Their Chromatic Numbers." Doctoral thesis. East Lansing, MI: Michigan State University, 1965.Vizing, V. G. "Some Unsolved Problems in Graph Theory." Russian Math. Surveys 23, 125-141, 1968.Cite this as:
Weisstein, Eric W. "Total Coloring Conjecture." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/TotalColoringConjecture.html