𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Parity and strong parity edge-colorings of graphs

✍ Scribed by Hsiang-Chun Hsu, Gerard J. Chang

Book ID
118801984
Publisher
Springer US
Year
2011
Tongue
English
Weight
430 KB
Volume
24
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Strong edge colorings of graphs
Strong edge colorings of graphs
✍ Odile Favaron; Hao Li; R.H. Schelp πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 349 KB

Let x'(G), called the strong coloring number of G, denote the minimum number of colors for which there is a proper edge coloring of a graph G in which no two of its vertices is incident to edges colored with the same set of colors. It is shown that Z'~(G) ~< Fcn], Β½ < c ~ 1, whenever A(G) is appropr

r-Strong edge colorings of graphs
r-Strong edge colorings of graphs
✍ S. Akbari; H. Bidkhori; N. Nosrati πŸ“‚ Article πŸ“… 2006 πŸ› Elsevier Science 🌐 English βš– 196 KB
Incidence and strong edge colorings of g
Incidence and strong edge colorings of graphs
✍ Richard A. Brualdi; Jennifer J. Quinn Massey πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 485 KB

We define the incidence coloring number of a graph and bound it in terms of the maximum degree. The incidence coloring number turns out to be the strong chromatic index of an associated bipartite graph. We improve a bound for the strong chromatic index of bipartite graphs all of whose cycle lengths