𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Edge-coloring of multigraphs: Recoloring technique

✍ Scribed by Mark K. Goldberg

Publisher
John Wiley and Sons
Year
1984
Tongue
English
Weight
626 KB
Volume
8
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Multiply balanced edge colorings of mult
Multiply balanced edge colorings of multigraphs
✍ M. A. Bahmanian; C. A. Rodger 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 259 KB

## Abstract In this article, a theorem is proved that generalizes several existing amalgamation results in various ways. The main aim is to disentangle a given edge‐colored amalgamated graph so that the result is a graph in which the edges are shared out among the vertices in ways that are fair wit

A Linear Algorithm for Edge-Coloring Ser
A Linear Algorithm for Edge-Coloring Series–Parallel Multigraphs
✍ Xiao Zhou; Hitoshi Suzuki; Takao Nishizeki 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 313 KB

Many combinatorial problems can be efficiently solved for series᎐parallel multigraphs. However, the edge-coloring problem of finding the minimum number of colors required for edge-coloring given graphs is one of a few well-known combinatorial problems for which no efficient algorithms have been obta

An NC Parallel Algorithm for Edge-Colori
An NC Parallel Algorithm for Edge-Coloring Series–Parallel Multigraphs
✍ Xiao Zhou; Hitoshi Suzuki; Takao Nishizeki 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 254 KB

Many combinatorial problems can be efficiently solved in parallel for series᎐parallel multigraphs. The edge-coloring problem is one of a few combinatorial problems for which no NC parallel algorithm has been obtained for series᎐parallel multigraphs. This paper gives an NC parallel algorithm for the

Semistrong edge coloring of graphs
Semistrong edge coloring of graphs
✍ András Gyárfás; Alice Hubenko 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 80 KB

## Abstract Weakening the notion of a strong (induced) matching of graphs, in this paper, we introduce the notion of a semistrong matching. A matching __M__ of a graph __G__ is called semistrong if each edge of __M__ has a vertex, which is of degree one in the induced subgraph __G__[__M__]. We stre