Effective on-line coloring of P_ 5-free graphs

DOI10.1007/BF01206361zbMATH Open0751.05039MaRDI QIDQ1180418FDOQ1180418

Jeno Lehel, András Gyárfás

Publication date: 27 June 1992

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

chromatic numbergraph coloringclique numberfirst fit algorithmone-line algorithm

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• On-line and first fit colorings of graphs
• An on-line graph coloring algorithm with sublinear performance ratio

Cited In (6)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1180418)