2 papers
math.CO2026
Harmonious Colorings: bounds, heuristics and integer-linear formulations
Júlio Araújo, Manoel Campêlo, Beatriz Martins +1
A proper coloring of a simple graph is harmonious if, for every pair of distinct edges , we have that . The harmonious chrom…
cs.DS2024
On the parameterized complexity of computing good edge-labelings
Davi de Andrade, Júlio Araújo, Laure Morelle +2
A good edge-labeling (gel for short) of a graph is a function such that, for any ordered pair of vertices of , there do not exist two disti…