Acyclic Edge Coloring Of Graphs
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 the chromatic index of Gand is denoted by χ(G). A proper edge coloring c is ca...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | en_US |
| Published: |
2013
|
| Subjects: | |
| Online Access: | http://etd.iisc.ernet.in/handle/2005/2263 http://etd.ncsi.iisc.ernet.in/abstracts/2885/G24692-Abs.pdf |