𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Some remarks on the chromatic index of a graph

✍ Scribed by Ivan Tafteberg Jakobsen

Book ID
112500602
Publisher
Springer
Year
1973
Tongue
English
Weight
525 KB
Volume
24
Category
Article
ISSN
0003-889X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The skew chromatic index of a graph
The skew chromatic index of a graph
✍ Marsha F Foregger πŸ“‚ Article πŸ“… 1984 πŸ› Elsevier Science 🌐 English βš– 594 KB

We define a skew edge coloring of a graph to be a set of two edge colorings such that no two edges are assigned the same unordered pair of colors. The skew chromatic index s(G) is the minimum number of colors required for a skew edge coloring of G. We show that this concept is closely related to tha

A Bound on the Strong Chromatic Index of
A Bound on the Strong Chromatic Index of a Graph
✍ Michael Molloy; Bruce Reed πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 695 KB

We show that the strong chromatic index of a graph with maximum degree 2 is at most (2&=) 2 2 , for some =>0. This answers a question of Erdo s and Nes etr il. 1997 Academic Press ## 1. Introduction A strong edge-colouring of a (simple) graph, G, is a proper edge-colouring of G with the added res