Bounded families for the on-line \(t\)-relaxed coloring

DOI10.1016/j.ipl.2005.07.001zbMath1184.68650OpenAlexW2057772476MaRDI QIDQ1044722

Concetta Pilotto, Agostino Capponi

Publication date: 18 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.07.001

zbMATH Keywords

combinatorial problemson-line coloringcompetitive algorithmsrelaxed coloring

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Online algorithms; streaming algorithms (68W27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The greedy algorithm is optimal for on-line edge coloring
• Relaxed chromatic numbers of graphs
• Relaxed game chromatic number of graphs
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• On-line and first fit colorings of graphs
• The Linearity of First-Fit Coloring of Interval Graphs
• On-Line and First-fit Coloring of Graphs that Do Not Induce $P_5 $

This page was built for publication: Bounded families for the on-line \(t\)-relaxed coloring