Abstract
A collection of results about coloring a family of circular arcs is presented. It is proved that the strong perfect graph conjecture is valid for circular-arc graphs. Some upper bounds are given on the number of colors needed to color various families of arcs. Finally, the problem of determining whether a family of arcs can be q-colored is converted into a multicommodity flow problem.
| Original language | English |
|---|---|
| Pages (from-to) | 493-502 |
| Number of pages | 10 |
| Journal | SIAM Journal on Applied Mathematics |
| Volume | 29 |
| Issue number | 3 |
| DOIs | |
| State | Published - 1975 |
Fingerprint
Dive into the research topics of 'COLORING A FAMILY OF CIRCULAR ARCS.'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver