๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A sublinear bound on the chromatic index of multigraphs

โœ Scribed by Michael Plantholt

Book ID
108316317
Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
894 KB
Volume
202
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

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