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

A Combined Logarithmic Bound on the Chromatic Index of Multigraphs

โœ Scribed by Michael Plantholt*

Book ID
112121132
Publisher
John Wiley and Sons
Year
2012
Tongue
English
Weight
630 KB
Volume
73
Category
Article
ISSN
0364-9024

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

The List Chromatic Index of a Bipartite
The List Chromatic Index of a Bipartite Multigraph
โœ F. Galvin ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 243 KB

For a bipartite multigraph, the list chromatic index is equal to the chromatic index (which is, of course, the same as the maximum degree). This generalizes Janssen's result on complete bipartite graphs \(K_{m, n}\) with \(m \neq n\); in the case of \(K_{n, n}\) it answers a question of Dinitz. (The