𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Asymptotics of the list-chromatic index for multigraphs

✍ Scribed by Jeff Kahn

Publisher
John Wiley and Sons
Year
2000
Tongue
English
Weight
272 KB
Volume
17
Category
Article
ISSN
1042-9832

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

Chromatic-index critical multigraphs of
Chromatic-index critical multigraphs of order 20
✍ GrοΏ½newald, Stefan πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 243 KB

The weak critical graph conjecture [1,7] claims that there exists a constant c > 0 such that every critical multigraph M with at most c β€’ βˆ†(M ) vertices has odd order. We disprove this conjecture by constructing critical multigraphs of order 20 with maximum degree k for all k β‰₯ 5.

The edge chromatic number of a directed/
The edge chromatic number of a directed/mixed multigraph
✍ Mel'nikov, Leonid S.; Vizing, Vadim G. πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 181 KB πŸ‘ 2 views

We consider colorings of the directed and undirected edges of a mixed multigraph G by an ordered set of colors. We color each undirected edge in one color and each directed edge in two colors, such that the color of the first half of a directed edge is smaller than the color of the second half. The