๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

First-Fit coloring of bounded tolerance graphs

โœ Scribed by H.A. Kierstead; Karin R. Saoub

Book ID
108112880
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
270 KB
Volume
159
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Coloring interval graphs with first-fit
Coloring interval graphs with first-fit
โœ H.A. Kierstead; Jun Qin ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 569 KB

Improved bounds on the performance of the on-line graph coloring algorithm First-Fit on interval graphs are obtained.

On-line and first fit colorings of graph
On-line and first fit colorings of graphs
โœ A. Gyรกrfรกs; J. Lehel ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 537 KB

A graph coloring algorithm that immediately colors the vertices taken from a list without looking ahead or changing colors already assigned is called "on-line coloring." The properties of on-line colorings are investigated in several classes of graphs. In many cases w e find on-line colorings that u