scientific article; zbMATH DE number 4170931

MaRDI QIDQ3496352zbMATH OpenFDO

Authors András Gyárfás, Jeno Lehel

Publication date 1990

zbMATH Keywords

proper colouringon-line chromatic numberon-line colouringfirst fit colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• On-line and first fit colorings of graphs
• scientific article; zbMATH DE number 65699
• Coloring inductive graphs on-line
• On-Line and First-fit Coloring of Graphs that Do Not Induce $P_5 $
• An on-line graph coloring algorithm with sublinear performance ratio

Cited in

(21)

• On the on-line chromatic number of the family of on-line 3-chromatic graphs
• On-line and first fit colorings of graphs
• On the First-Fit Chromatic Number of Graphs
• An on-line competitive algorithm for coloring P₈-free bipartite graphs
• Batch coloring of graphs
• Computational aspects of greedy partitioning of graphs
• A note on the online first-fit algorithm for coloring \(k\)-inductive graphs
• Obtaining online ecological colourings by generalizing first-fit
• On-line 3-chromatic graphs. II: Critical graphs
• On Computational Aspects of Greedy Partitioning of Graphs
• Open problems on graph coloring for special graph classes
• scientific article; zbMATH DE number 65699 (Why is no real title available?)
• Coloring inductive graphs on-line
• Deciding the on-line chromatic number of a graph with pre-coloring is PSPACE-complete
• Batch Coloring of Graphs
• On-line and list on-line colorings of graphs and hypergraphs
• Relative Worst-Order Analysis: A Survey
• Obtaining online ecological colourings by generalizing first-fit
• Bounded families for the on-line \(t\)-relaxed coloring
• On the Grundy number of graphs with few P₄'s
• An on-line competitive algorithm for coloring bipartite graphs without long induced paths

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 Q3496352)