On graphs with a large number of edge-colorings avoiding a rainbow triangle.

Carlos Hoppen Hanno Lefmann Knut Odermann

Published in: Eur. J. Comb. (2017)

Keyphrases

genetic algorithm
image processing
computational complexity
bipartite graph
fixed number
maximum number
weighted graph
edge information
undirected graph