Approximating the Maximum 3- and 4-Edge-Colorable Subgraph

(Extended Abstract)
  • Marcin Kamiński
  • Łukasz Kowalik
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6139)


We study large k-edge-colorable subgraphs of simple graphs and multigraphs. We show that:

  • every simple subcubic graph G has a 3-edge-colorable subgraph (3-ECS) with at least \(\frac{13}{15}|E(G)|\) edges, unless G is isomorphic to K 4 with one edge subdivided,

  • every subcubic multigraph G has a 3-ECS with at least \(\frac{7}{9}|E(G)|\) edges, unless G is isomorphic to K 3 with one edge doubled,

  • every simple graph G of maximum degree 4 has a 4-ECS with at least \(\frac{5}{6}|E(G)|\) edges, unless G is isomorphic to K 5.

We use these combinatorial results to design new approximation algorithms for the Maximum k-Edge-Colorable Subgraph problem. In particular, for k = 3 we obtain a \(\frac{13}{15}\)-approximation for simple graphs and a \(\frac{7}{9}\)-approximation for multigraphs; and for k = 4, we obtain a \(\frac{9}{11}\)-approximation. We achieve this by presenting a general framework of approximation algorithms that can be used for any value of k.


Approximation Algorithm Maximum Degree Approximation Ratio Simple Graph Colored Edge 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Albertson, M.O., Haas, R.: Parsimonious edge coloring. Discrete Mathematics 148(1-3), 1–7 (1996)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Chen, Z.Z., Tanahashi, R.: Approximating maximum edge 2-coloring in simple graphs via local improvement. Theor. Comput. Sci. 410(45), 4543–4553 (2009)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Chen, Z.Z., Tanahashi, R., Wang, L.: An improved approximation algorithm for maximum edge 2-coloring in simple graphs. J. Discrete Algorithms 6(2), 205–215 (2008)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Cornuéjols, G., Pulleyblank, W.: A matching problem with side conditions. Discrete Mathematics 29, 135–159 (1980)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Diestel, R.: Graph Theory, Electronic edn. Springer, Heidelberg (2005)Google Scholar
  6. 6.
    Feige, U., Ofek, E., Wieder, U.: Approximating maximum edge coloring in multigraphs. In: Jansen, K., Leonardi, S., Vazirani, V.V. (eds.) APPROX 2002. LNCS, vol. 2462, pp. 108–121. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  7. 7.
    Holyer, I.: The NP-completeness of edge coloring. SIAM Journal on Computing 10, 718–720 (1981)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Kosowski, A.: Approximating the maximum 2 − and 3 −edge-colorable subgraph problems. Discrete Applied Mathematics 157, 3593–3600 (2009)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Leven, D., Galil, Z.: NP-completeness of finding the chromatic index of regular graphs. Journal of Algorithms 4, 35–44 (1983)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Rizzi, R.: Approximating the maximum 3-edge-colorable subgraph problem. Discrete Mathematics 309, 4166–4170 (2009)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Sanders, P., Steurer, D.: An asymptotic approximation scheme for multigraph edge coloring. ACM Trans. Algorithms 4(2), 1–24 (2008)CrossRefMathSciNetGoogle Scholar
  12. 12.
    Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Heidelberg (2003)zbMATHGoogle Scholar
  13. 13.
    Shannon, C.E.: A theorem on coloring the lines of a network. J. Math. Phys. 28, 148–151 (1949)zbMATHMathSciNetGoogle Scholar
  14. 14.
    Vizing, V.G.: On the estimate of the chromatic class of a p-graph. Diskret. Analiz 3, 25–30 (1964)MathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Marcin Kamiński
    • 1
  • Łukasz Kowalik
    • 2
  1. 1.Département d’InformatiqueUniversité Libre de Bruxelles 
  2. 2.Institute of InformaticsUniversity of Warsaw 

Personalised recommendations