Title of article
Edge-coloring of multigraphs
Author/Authors
Martin Kochol، نويسنده , , Nad’a Krivo??kov?، نويسنده , , Silvia Smejov?، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
6
From page
229
To page
234
Abstract
We introduce a monotone invariant image on graphs and show that it is an upper bound of the chromatic index of graphs. Moreover, there exist polynomial time algorithms for computing image and for coloring edges of a multigraph G by image colors. This generalizes the classical edge-coloring theorems of Shannon and Vizing.
Keywords
r-Ordering of graphs , Edge-coloring , Supermultiplicity of graphs
Journal title
Discrete Mathematics
Serial Year
2005
Journal title
Discrete Mathematics
Record number
948443
Link To Document