Sign in

On a Sufficient Condition for Planar Graphs of Maximum Degree 6 to be Totally 7-Colorable

By Enqiang Zhu and others
A total \(k\)-coloring of a graph is an assignment of \(k\) colors to its vertices and edges such that no two adjacent or incident elements receive the same color. The Total Coloring Conjecture (TCC) states that every simple graph \(G\) has a total (\(\Delta(G)+2\))-coloring, where \(\Delta(G)\) is the maximum degree... Show more
December 1, 2018
Loading PDF…
Loading full text...
Similar articles
Loading recommendations...