Interval incidence graph coloring
✍ Scribed by Janczewski, Robert; Małafiejska, Anna; Małafiejski, Michał
- Book ID
- 122215389
- Publisher
- Elsevier Science
- Year
- 2015
- Tongue
- English
- Weight
- 433 KB
- Volume
- 182
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## This paper is complementary to Kubale (1989). We consider herein a problem of interval coloring the edges of a graph under the restriction that certain colors cannot be used for some edges. We give lower and upper bounds on the minimum number of colors required for such a coloring. Since the ge
Improved bounds on the performance of the on-line graph coloring algorithm First-Fit on interval graphs are obtained.
## Abstract Graph bundles generalize the notion of covering graphs and products of graphs. Several results about the chromatic numbers of graph bundles based on the Cartesian product, the strong product and the tensor product are presented. © 1995 John Wiley & Sons, Inc.