Approximation and hardness results for the maximum edge q-coloring problem

Anna Adamaszek, Alexandru Popa. Approximation and hardness results for the maximum edge q-coloring problem. J. Discrete Algorithms, 38:1-8, 2016. [doi]

@article{AdamaszekP16,
  title = {Approximation and hardness results for the maximum edge q-coloring problem},
  author = {Anna Adamaszek and Alexandru Popa},
  year = {2016},
  doi = {10.1016/j.jda.2016.09.003},
  url = {http://dx.doi.org/10.1016/j.jda.2016.09.003},
  researchr = {https://researchr.org/publication/AdamaszekP16},
  cites = {0},
  citedby = {0},
  journal = {J. Discrete Algorithms},
  volume = {38},
  pages = {1-8},
}