On-line coloring and cliques covering for \(\mathbb K_{s,t}\)-free graphs

DOI10.1007/s00236-005-0167-1zbMath1079.68071OpenAlexW2108315684MaRDI QIDQ2576659

Iwona Cieślik

Publication date: 14 December 2005

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-005-0167-1

zbMATH Keywords

first fit strategy

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

On-line graph coloring of \({\mathbb{P}_5}\)-free graphs

Cites Work

• Effective on-line coloring of \(P_ 5\)-free graphs
• On-line and first fit colorings of graphs
• On some packing problem related to dynamic storage allocation
• On-Line 3-Chromatic Graphs I. Triangle-Free Graphs
• Optimal on-line coloring of circular arc graphs
• On-Line and First-fit Coloring of Graphs that Do Not Induce $P_5 $
• Bounds for Certain Multiprocessing Anomalies