Bounded families for the on-line t-relaxed coloring

Authors:
Agostino Capponi;Concetta Pilotto
Affiliations:
California Institute of Technology, Department of Computer Science, Pasadena, CA;California Institute of Technology, Department of Computer Science, Pasadena, CA
Venue:
Information Processing Letters
Year:
2005

Citing 5
Cited 0

The linearity of first-fit coloring of interval graphs

SIAM Journal on Discrete Mathematics
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
On the Complexity of Some Coloring Games

WG '90 Proceedings of the 16rd International Workshop on Graph-Theoretic Concepts in Computer Science

Quantified Score

Hi-index	0.89

Visualization

Abstract

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.