Edge-coloring of multigraphs: Recoloring technique (Q3216672)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3882452
Language Label Description Also known as
default for all languages
No label defined
    English
    Edge-coloring of multigraphs: Recoloring technique
    scientific article; zbMATH DE number 3882452

      Statements

      Edge-coloring of multigraphs: Recoloring technique (English)
      0 references
      0 references
      1984
      0 references
      edge-colourings
      0 references
      link-chain recolouring
      0 references
      chromatic index
      0 references
      multigraphs
      0 references
      The Kempe-chain and fan-sequence recolourings are often used in the study of edge-colourings of graphs and multigraphs. Another technique for edge- colourings, called the link-chain recolouring, is introduced in this paper. Some old results published by the author several years ago are included in this paper. According to the author, he decided to publish these old results again because the results are generally inaccessible in the West. The new results contained in this paper include: 1. New upper and lower bounds for the chromatic index of a finite multigraph. 2. A complete description of multigraphs M satisfying \(\chi '(M)>1/8\{9\Delta (M)+6\}\) where \(\chi\) '(M) is the chromatic index of M and \(\Delta\) (M) is the maximum valency of M. Several new and old conjectures concerning the chromatic index of multigraphs are also discussed in this paper.
      0 references

      Identifiers