𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A polyhedral approach to edge coloring

✍ Scribed by George L Nemhauser; Sungsoo Park

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
492 KB
Volume
10
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Polyhedral Approach for Graph Coloring
A Polyhedral Approach for Graph Coloring1
✍ Isabel MΓ©ndez DΓ­az -; Paula Zabala πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 255 KB
Definitions of criticality with respect
Definitions of criticality with respect to edge-coloring
✍ A. J. W. Helton πŸ“‚ Article πŸ“… 1977 πŸ› John Wiley and Sons 🌐 English βš– 310 KB

## Abstract Here we examine six definitions of criticality concerning the chromatic index (edge chromatic number) of a simple graph. Five of these turn out to be almost always almost equivalent. Some problems arise and some conjectures are posed.

A generalization of edge-coloring in gra
A generalization of edge-coloring in graphs
✍ S. Louis Hakimi; Oded Kariv πŸ“‚ Article πŸ“… 1986 πŸ› John Wiley and Sons 🌐 English βš– 754 KB

Bounds are given on the number of colors required to color the edges of a graph (multigraph) such that each color appears at each vertex u at most m(u) times. The known results and proofs generalize in natural ways. Certain new edge-coloring problems, which have no counterparts when m(u) = 1 for all