𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Maximum Chromatic Index of Multigraphs with Given Δ and

✍ Scribed by Diego Scheide, Michael Stiebitz

Book ID
118783090
Publisher
Springer Japan
Year
2011
Tongue
English
Weight
139 KB
Volume
28
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note concerning the chromatic index of
A note concerning the chromatic index of multigraphs
✍ A. J. W. Hilton; Bill Jackson 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 214 KB

We improve an upper bound for the chromatic index of a multigraph due to Andersen and Gol'dberg. As a corollary w e deduce that if no t w o edges of multiplicity at least t w o in G are adjacent, then ,y'(G) s A ( G ) + 1. In addition w e generalize results concerning the structure of critical graph

Improved bounds for the chromatic index
Improved bounds for the chromatic index of graphs and multigraphs
✍ Hakimi, S. Louis; Schmeichel, Edward F. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 321 KB 👁 2 views

We show that coloring the edges of a multigraph G in a particular order often leads to improved upper bounds for the chromatic index χ (G). Applying this to simple graphs, we significantly generalize recent conditions based on the core of G (i.e., the subgraph of G induced by the vertices of degree

The chromatic index of graphs with large
The chromatic index of graphs with large maximum degree
✍ Michael J. Plantholt 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 508 KB

Vizing's Theorem, any graph G has chromatic index equal either to its maximum degree A(G) or A(G) + 1. A simple method is given for determining exactly the chromatic index of any graph with 2s + 2 vertices and maximum degree 2s.