The linearity of first-fit coloring of interval graphs
SIAM Journal on Discrete Mathematics
On the complexity of some coloring games
WG '90 Proceedings of the 16th international workshop on Graph-theoretic concepts in computer science
The greedy algorithm is optimal for on-line edge coloring
Information Processing Letters
On-Line and First-Fit Coloring of Graphs That Do Not Induce $P_5$
SIAM Journal on Discrete Mathematics
Relaxed game chromatic number of graphs
Discrete Mathematics
Hi-index | 0.89 |
We introduce a new generalization of the on-line coloring game. We define the concept of bounded family for on-line t-relaxed colorings. This extends the concept of on-line competitive coloring algorithms to t-relaxed colorings. We characterize the trees T for which the family of T-free graphs is bounded and show that the corresponding bounding function is linear.