On-line coloring of perfect graphs

DOI10.1007/BF01271267zbMath0881.68087OpenAlexW1983054380MaRDI QIDQ1375694

Henry A. Kierstead, Katalin Kolossa

Publication date: 11 January 1998

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01271267

zbMATH Keywords

on-line coloringperfect graphs=20

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

On-line coloring \(k\)-colorable graphs

Cites Work

• Unnamed Item
• An on-line graph coloring algorithm with sublinear performance ratio
• On-line and first fit colorings of graphs
• The Linearity of First-Fit Coloring of Interval Graphs
• Randomized online graph coloring
• Effective coloration
• On-Line Coloring and Recursive Graph Theory
• On-Line and First-fit Coloring of Graphs that Do Not Induce $P_5 $

This page was built for publication: On-line coloring of perfect graphs