Parameterized Complexity of Maximum Edge Coloring in Graphs
The classical graph edge coloring problem deals in coloring the edges of a given graph with minimum number of colors such that no two adjacent edges in the graph, get the same color in the proposed coloring. In the following work, we look at the other end of the spectrum where in our goal is to maxi...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | en_US |
| Published: |
2018
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/2005/3255 http://etd.ncsi.iisc.ernet.in/abstracts/4116/G26293-Abs.pdf |