Approximate Constrained Bipartite Edge Coloring - Archive ouverte HAL Access content directly
Journal Articles Discrete Applied Mathematics Year : 2004

Approximate Constrained Bipartite Edge Coloring


We study the following Constrained Bipartite Edge Coloring (CBEC) problem: We are given a bipartite graph G(U,V,E) of maximum degree l with n vertices, in which some of the edges have been legally colored with c colors. We wish to complete the coloring of the edges of G minimizing the total number of colors used. The problem has been proved to be NP-hard event for bipartite graphs of maximum degree three.
Fichier principal
Vignette du fichier
CFKP_04.pdf (257.08 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00371101 , version 1 (26-03-2009)


  • HAL Id : hal-00371101 , version 1


Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stéphane Pérennes, Pino Persiano, et al.. Approximate Constrained Bipartite Edge Coloring. Discrete Applied Mathematics, 2004, 143 (1-3), pp.54--61. ⟨hal-00371101⟩
220 View
129 Download


Gmail Facebook Twitter LinkedIn More