A sharp upper bound for the harmonious total chromatic number of graphs and multigraphs

M. Abreu, J. B. Gauci, D. Mattiolo +4

A proper total colouring of a graph $G$ is called harmonious if it has the further property that when replacing each unordered pair of incident vertices and edges with their colour…