Browsing Division of Electrical, Electronics, and Computer Science (EECS) by Subject "2-Degenerate Graphs"
Now showing items 1-1 of 1
-
Acyclic Edge Coloring Of Graphs
(2013-10-07)A proper edge coloring of G =(V,E)is a map c : E → C (where C is the set of available colors ) with c(e) ≠ c(ƒ) for any adjacent edges e,f. The minimum number of colors needed to properly color the edges of G, is called ...