𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A specialf-edge cover-coloring of multigraphs

✍ Scribed by Yongxun Xin; Guizhen Liu

Book ID
107619681
Publisher
Springer-Verlag
Year
2008
Tongue
English
Weight
287 KB
Volume
26
Category
Article
ISSN
1598-5865

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Edge-coloring of multigraphs
Edge-coloring of multigraphs
✍ Martin Kochol; Nad’a KrivoňÑkovΓ‘; Silvia SmejovΓ‘ πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 167 KB
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

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