2 citations · 3 across the 2 of their papers we have counts for
2 papers
math.CO2024★ 1 cited
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 is called harmonious if it has the further property that when replacing each unordered pair of incident vertices and edges with their colour…
math.CO2017★ 2 cited
On measures of edge-uncolorability of cubic graphs: A brief survey and some new results
M. A. Fiol, G. Mazzuoccolo, E. Steffen
There are many hard conjectures in graph theory, like Tutte's 5-flow conjecture, and the 5-cycle double cover conjecture, which would be true in general if they would be true for c…