Effective on-line coloring of \(P_ 5\)-free graphs

DOI10.1007/BF01206361zbMath0751.05039MaRDI QIDQ1180418

Jenő Lehel, András Gyárfás

Publication date: 27 June 1992

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

graph coloringchromatic numberclique numberfirst fit algorithmone-line algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (max. 100)

On the Grundy number of Cameron graphs ⋮ Star coloring of certain graph classes ⋮ On-line graph coloring of \({\mathbb{P}_5}\)-free graphs ⋮ First-fit coloring of \(\{P_{5},K_{4}-e\}\)-free graphs ⋮ Open Problems on Graph Coloring for Special Graph Classes ⋮ On-line coloring and cliques covering for \(\mathbb K_{s,t}\)-free graphs

Cites Work

• Unnamed Item
• An on-line graph coloring algorithm with sublinear performance ratio
• On-line and first fit colorings of graphs

This page was built for publication: Effective on-line coloring of \(P_ 5\)-free graphs