𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Linearity of First-Fit Coloring of Interval Graphs

✍ Scribed by Kierstead, H. A.

Book ID
118197505
Publisher
Society for Industrial and Applied Mathematics
Year
1988
Tongue
English
Weight
656 KB
Volume
1
Category
Article
ISSN
0895-4801

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.

Interval incidence coloring of bipartite
Interval incidence coloring of bipartite graphs
✍ Janczewski, Robert; MaΕ‚afiejska, Anna; MaΕ‚afiejski, MichaΕ‚ πŸ“‚ Article πŸ“… 2014 πŸ› Elsevier Science 🌐 English βš– 498 KB
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