Title of article
Chromatic Edge Strength of Some Multigraphs
Author/Authors
Cardinal، نويسنده , , Jean and Ravelomanana، نويسنده , , Vlady and Valencia-Pabon، نويسنده , , Mario، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
6
From page
39
To page
44
Abstract
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.
Keywords
minimum sum coloring , chromatic strength , graph coloring
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2008
Journal title
Electronic Notes in Discrete Mathematics
Record number
1454808
Link To Document