scientific article; zbMATH DE number 4170931

zbMATH Open0712.05026MaRDI QIDQ3496352FDOQ3496352

András Gyárfás, Jeno Lehel

Publication date: 1990

Title of this publication is not available (Why is that?)

Recommendations

• On-line and first fit colorings of graphs
• scientific article
• 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

zbMATH Keywords

proper colouringon-line chromatic numberon-line colouringfirst fit colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (18)

• 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
• Batch coloring of graphs
• Online chromatic number is PSPACE-complete
• Computational aspects of greedy partitioning of graphs
• Adding isolated vertices makes some greedy online algorithms optimal
• On-line 3-chromatic graphs. II: Critical graphs
• On Computational Aspects of Greedy Partitioning of Graphs
• Title not available (Why is that?)
• An On-line Competitive Algorithm for Coloring $$P_8$$-free Bipartite Graphs
• Coloring inductive graphs on-line
• Batch Coloring of Graphs
• Relative Worst-Order Analysis: A Survey
• Open Problems on Graph Coloring for Special Graph Classes
• Deciding the On-line Chromatic Number of a Graph with Pre-coloring Is PSPACE-Complete
• On the Grundy number of graphs with few \(P_4\)'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)