✦ LIBER ✦

Edge-coloring of multigraphs

✍ Scribed by Martin Kochol; Nad’a Krivoňáková; Silvia Smejová

Book ID: 108113549
Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 167 KB
Volume: 300
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2005.04.017

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Edge-coloring of multigraphs: Recoloring

Edge-coloring of multigraphs: Recoloring technique

✍ Mark K. Goldberg 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 626 KB

A specialf-edge cover-coloring of multig

A specialf-edge cover-coloring of multigraphs

✍ Yongxun Xin; Guizhen Liu 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 287 KB

Edge-Coloring Bipartite Multigraphs inO(

Edge-Coloring Bipartite Multigraphs inO(ElogD) Time

✍ Richard Cole; Kirstin Ost; Stefan Schirra 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 155 KB

Applications of edge coloring of multigr

Applications of edge coloring of multigraphs to vertex coloring of graphs

✍ H.A. Kierstead 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 754 KB

A simple algorithm for edge-coloring bip

A simple algorithm for edge-coloring bipartite multigraphs

✍ Noga Alon 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 52 KB

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