| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652658 | Electronic Notes in Discrete Mathematics | 2008 | 6 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
