Approximation and Hardness Results for the Maximum Edge q-coloring Problem

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6507)


We consider the problem of coloring edges of a graph subject to the following constraint: for every vertex v, all the edges incident to v have to be colored with at most q colors. The goal is to find a coloring satisfying the above constraint and using the maximum number of colors.

This problem has been studied in the past from the combinatorial and algorithmic point of view. The optimal coloring is known for some special classes of graphs. There is also an approximation algorithm for general graphs, which in the case q = 2 gives a 2-approximation. However, the complexity of finding the optimal coloring was not known.

We prove that for any integer q ≥ 2 the problem is NP-Hard and APX-Hard. We also present a 5/3-approximation algorithm for q = 2 for graphs with a perfect matching.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Erdős, P., Simonovits, M., Sós, V.T.: Anti-ramsey theorems. In: Infinite and finite sets (Colloq., Keszthely, 1973; dedicated to P. Erdős on his 60th birthday), Vol. II, vol. 10, pp. 633–643. Colloq. Math. Soc. János Bolyai (1975)Google Scholar
  2. 2.
    Feng, W., Chen, P., Zhang, B.: Approximate maximum edge coloring within factor 2: a further analysis. In: ISORA, pp. 182–189 (2008)Google Scholar
  3. 3.
    Feng, W., Zhang, L., Qu, W., Wang, H.: Approximation algorithms for maximum edge coloring problem. In: Cai, J.-Y., Cooper, S.B., Zhu, H. (eds.) TAMC 2007. LNCS, vol. 4484, pp. 646–658. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  4. 4.
    Feng, W., Zhang, L., Wang, H.: Approximation algorithm for maximum edge coloring. Theor. Comput. Sci. 410(11), 1022–1029 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Fujita, S., Magnant, C., Ozeki, K.: Rainbow generalizations of ramsey theory: A survey. Graphs and Combinatorics (2010)Google Scholar
  6. 6.
    Jiang, T.: Edge-colorings with no large polychromatic stars. Graphs and Combinatorics 18(2), 303–308 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Manoussakis, Y., Spyratos, M., Tuza, Z., Voight, M.: Minimal colorings for properly colored subgraphs. Graphs and Combinatorics 12(1), 345–360 (1996)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Montellano-Ballesteros, J.J.: On totally multicolored stars. Journal of Graph Theory 51(3), 225–243 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Raniwala, A., Chiueh, T.-c.: Architecture and algorithms for an ieee 802.11-based multi-channel wireless mesh network. In: INFOCOM, pp. 2223–2234. IEEE, Los Alamitos (2005)Google Scholar
  10. 10.
    Raniwala, A., Gopalan, K., Chiueh, T.-c.: Centralized channel assignment and routing algorithms for multi-channel wireless mesh networks. Mobile Computing and Communications Review 8(2), 50–65 (2004)CrossRefGoogle Scholar
  11. 11.
    Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  1. 1.Centre for Discrete Mathematics and its Applications (DIMAP) and Department of Computer ScienceUniversity of WarwickUK
  2. 2.Department of Computer ScienceUniversity of BristolBristolUK

Personalised recommendations