Acyclic edge coloring of planar graphs with Δ colors.

Dávid Hudák Frantisek Kardos Borut Luzar Roman Soták Riste Skrekovski

Published in: Discret. Appl. Math. (2012)

Keyphrases

planar graphs
weighted graph
undirected graph
color images
np hard
edge detection
edge information
minimum weight
np complete
approximate inference
image processing
upper bound
closed form
complex networks
approximation algorithms
bipartite graph