par Cardinal, Jean 
;Ravelomanana, Vlady V.;Valencia-Pabon, Mario M.
Référence Electronic Notes in Discrete Mathematics, 30, C, page (39-44)
Publication Publié, 2008-02
;Ravelomanana, Vlady V.;Valencia-Pabon, Mario M.Référence Electronic Notes in Discrete Mathematics, 30, C, page (39-44)
Publication Publié, 2008-02
Article révisé par les pairs
| Résumé : | The edge strength s′ (G) of a multigraph G is the minimum number of colors in a minimum sum edge coloring of G. We give closed formulas for the edge strength of bipartite multigraphs and multicycles. These are shown to be classes of multigraphs for which the edge strength is always equal to the chromatic index. © 2008 Elsevier B.V. All rights reserved. |
