𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the fractional chromatic index of a graph and its complement

✍ Scribed by David Avis; Caterina De Simone; Bruce Reed

Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
146 KB
Volume
33
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A note on the line-distinguishing chroma
A note on the line-distinguishing chromatic number and the chromatic index of a graph
✍ N. Zagaglia Salvi πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 126 KB πŸ‘ 1 views

## Abstract Let Ξ»(__G__) be the line‐distinguishing chromatic number and __x__β€²(__G__) the chromatic index of a graph __G__. We prove the relation Ξ»(__G__) β‰₯ __x__β€²(__G__), conjectured by Harary and Plantholt. Β© 1993 John Wiley & Sons, Inc.

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

On the oriented chromatic index of orien
On the oriented chromatic index of oriented graphs
✍ Pascal Ochem; Alexandre Pinlou; Γ‰ric Sopena πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 227 KB

## Abstract A homomorphism from an oriented graph __G__ to an oriented graph __H__ is a mapping $\varphi$ from the set of vertices of __G__ to the set of vertices of __H__ such that $\buildrel {\longrightarrow}\over {\varphi (u) \varphi (v)}$ is an arc in __H__ whenever $\buildrel {\longrightarrow}