Acyclic Edge-Coloring of Planar Graphs: Δ Colors Suffice When Δ is Large.

Daniel W. Cranston

Published in: SIAM J. Discret. Math. (2019)

Keyphrases

planar graphs
weighted graph
undirected graph
np hard
color images
edge detection
minimum weight
np complete
edge detector
image processing
lower bound
approximation algorithms
partition function