scientific article; zbMATH DE number 65699

MaRDI QIDQ4010310zbMATH OpenFDO

Authors H. A. Kierstead, William T. Trotter

Publication date 27 September 1992

zbMATH Keywords

cliqueFirst-Fit algorithmgraph coloringon-line algorithmon-line graphupper bounds

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• On-Line and First-fit Coloring of Graphs that Do Not Induce $P_5 $
• An on-line graph coloring algorithm with sublinear performance ratio
• On-line and first fit colorings of graphs
• scientific article; zbMATH DE number 4170931
• Effective on-line coloring of \(P_ 5\)-free graphs

Cited in

(30)

• An on-line graph coloring algorithm with sublinear performance ratio
• Effective on-line coloring of \(P_ 5\)-free graphs
• On-line 3-chromatic graphs. II: Critical graphs
• Obtaining online ecological colourings by generalizing first-fit
• On-line algorithms for ordered sets and comparability graphs
• On the on-line chromatic number of the family of on-line 3-chromatic graphs
• Inequalities for the Grundy chromatic number of graphs
• On-line graph coloring of \({\mathbb{P}_5}\)-free graphs
• On-line coloring and cliques covering for \(\mathbb K_{s,t}\)-free graphs
• Lower bounds for on-line graph colorings
• Online graph coloring against a randomized adversary
• First-fit colorings of graphs with no cycles of a prescribed even length
• Online Multi-Coloring with Advice
• scientific article; zbMATH DE number 4170931 (Why is no real title available?)
• Obtaining online ecological colourings by generalizing first-fit
• On-line coloring of \(I_{s}\)-free graphs
• On-line and first fit colorings of graphs
• scientific article; zbMATH DE number 1303205 (Why is no real title available?)
• On-Line Coloring and Recursive Graph Theory
• scientific article; zbMATH DE number 2080195 (Why is no real title available?)
• On-Line and First-fit Coloring of Graphs that Do Not Induce $P_5 $
• Online coloring of bipartite graphs with and without advice
• First-fit coloring of incomparability graphs
• On-line coloring between two lines
• On-line P-coloring of graphs
• \(\mathcal{O}(VE)\) time algorithms for the Grundy (first-fit) chromatic number of block graphs and graphs with large girth
• Results on the Grundy chromatic number of graphs
• Online coloring graphs with high girth and high odd girth
• Online hypergraph coloring
• A note on the online first-fit algorithm for coloring \(k\)-inductive graphs

This page was built for publication:

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