scientific article
From MaRDI portal
Publication:3496352
zbMath0712.05026MaRDI QIDQ3496352
Publication date: 1990
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (14)
Adding isolated vertices makes some greedy online algorithms optimal ⋮ On the on-line chromatic number of the family of on-line 3-chromatic graphs ⋮ On-line 3-chromatic graphs. II: Critical graphs ⋮ An On-line Competitive Algorithm for Coloring $$P_8$$-free Bipartite Graphs ⋮ Deciding the On-line Chromatic Number of a Graph with Pre-coloring Is PSPACE-Complete ⋮ Relative Worst-Order Analysis: A Survey ⋮ Computational aspects of greedy partitioning of graphs ⋮ Batch Coloring of Graphs ⋮ On Computational Aspects of Greedy Partitioning of Graphs ⋮ An on-line competitive algorithm for coloring bipartite graphs without long induced paths ⋮ Batch coloring of graphs ⋮ On the Grundy number of graphs with few \(P_4\)'s ⋮ Online chromatic number is PSPACE-complete ⋮ Open Problems on Graph Coloring for Special Graph Classes
This page was built for publication:
