Sciweavers

Share
ALGORITHMICA
2002
159views more  ALGORITHMICA 2002»
9 years 6 months ago
Algorithmic Aspects of Acyclic Edge Colorings
A proper coloring of the edges of a graph G is called acyclic if there is no 2-colored cycle in G. The acyclic edge chromatic number of G, denoted by a (G), is the least number of...
Noga Alon, Ayal Zaks
books